/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/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:56:59,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:56:59,306 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:56:59,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:56:59,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:56:59,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:56:59,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:56:59,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:56:59,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:56:59,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:56:59,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:56:59,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:56:59,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:56:59,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:56:59,330 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:56:59,330 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:56:59,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:56:59,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:56:59,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:56:59,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:56:59,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:56:59,332 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:56:59,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:56:59,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:56:59,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:56:59,541 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:56:59,541 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:56:59,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2025-04-13 20:57:00,762 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63a7eaf0/9fd9acce528a4539a61d3e80280ca3c9/FLAG6cdbeff11 [2025-04-13 20:57:00,951 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:57:00,956 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2025-04-13 20:57:00,966 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63a7eaf0/9fd9acce528a4539a61d3e80280ca3c9/FLAG6cdbeff11 [2025-04-13 20:57:01,913 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63a7eaf0/9fd9acce528a4539a61d3e80280ca3c9 [2025-04-13 20:57:01,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:57:01,916 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:57:01,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:57:01,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:57:01,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:57:01,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:57:01" (1/1) ... [2025-04-13 20:57:01,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668bb436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:01, skipping insertion in model container [2025-04-13 20:57:01,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:57:01" (1/1) ... [2025-04-13 20:57:01,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:57:02,099 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/popl20-three-array-sum.wvr.c[2730,2743] [2025-04-13 20:57:02,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:57:02,119 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:57:02,154 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/popl20-three-array-sum.wvr.c[2730,2743] [2025-04-13 20:57:02,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:57:02,173 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:57:02,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02 WrapperNode [2025-04-13 20:57:02,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:57:02,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:57:02,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:57:02,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:57:02,180 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:57:02" (1/1) ... [2025-04-13 20:57:02,189 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:57:02" (1/1) ... [2025-04-13 20:57:02,210 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 129 [2025-04-13 20:57:02,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:57:02,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:57:02,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:57:02,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:57:02,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,232 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-13 20:57:02,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:57:02,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:57:02,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:57:02,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:57:02,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (1/1) ... [2025-04-13 20:57:02,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:57:02,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:57:02,278 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:57:02,280 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:57:02,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:57:02,298 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:57:02,298 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:57:02,298 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:57:02,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:57:02,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:57:02,299 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:57:02,386 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:57:02,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:57:02,628 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:57:02,629 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:57:02,629 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:57:02,852 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:57:02,857 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:57:02,861 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:57:02,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:57:02 BoogieIcfgContainer [2025-04-13 20:57:02,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:57:02,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:57:02,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:57:02,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:57:02,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:57:01" (1/3) ... [2025-04-13 20:57:02,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb59ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:57:02, skipping insertion in model container [2025-04-13 20:57:02,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:57:02" (2/3) ... [2025-04-13 20:57:02,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb59ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:57:02, skipping insertion in model container [2025-04-13 20:57:02,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:57:02" (3/3) ... [2025-04-13 20:57:02,871 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-04-13 20:57:02,880 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:57:02,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 29 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 20:57:02,883 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:57:02,926 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:57:02,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 38 transitions, 97 flow [2025-04-13 20:57:02,977 INFO L116 PetriNetUnfolderBase]: 10/35 cut-off events. [2025-04-13 20:57:02,979 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:57:02,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 10/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2025-04-13 20:57:02,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 38 transitions, 97 flow [2025-04-13 20:57:02,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 34 transitions, 86 flow [2025-04-13 20:57:02,988 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:57:03,000 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;@54986491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:57:03,002 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:57:03,012 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:57:03,012 INFO L116 PetriNetUnfolderBase]: 10/33 cut-off events. [2025-04-13 20:57:03,012 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:57:03,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:03,012 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:57:03,013 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:03,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1005034374, now seen corresponding path program 1 times [2025-04-13 20:57:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:03,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861849903] [2025-04-13 20:57:03,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:57:03,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:03,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:57:03,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:57:03,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:03,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:03,556 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:57:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:03,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861849903] [2025-04-13 20:57:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861849903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:57:03,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:57:03,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:57:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239235436] [2025-04-13 20:57:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:57:03,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:57:03,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:03,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:57:03,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:57:03,586 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:57:03,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:57:03,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:03,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:57:03,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:03,800 INFO L116 PetriNetUnfolderBase]: 751/1043 cut-off events. [2025-04-13 20:57:03,800 INFO L117 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-04-13 20:57:03,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 1043 events. 751/1043 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3477 event pairs, 172 based on Foata normal form. 1/678 useless extension candidates. Maximal degree in co-relation 1814. Up to 595 conditions per place. [2025-04-13 20:57:03,811 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 49 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2025-04-13 20:57:03,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 55 transitions, 249 flow [2025-04-13 20:57:03,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:57:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:57:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-04-13 20:57:03,822 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2025-04-13 20:57:03,823 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 86 flow. Second operand 3 states and 69 transitions. [2025-04-13 20:57:03,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 55 transitions, 249 flow [2025-04-13 20:57:03,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 55 transitions, 227 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:57:03,833 INFO L231 Difference]: Finished difference. Result has 31 places, 36 transitions, 93 flow [2025-04-13 20:57:03,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=31, PETRI_TRANSITIONS=36} [2025-04-13 20:57:03,837 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-04-13 20:57:03,837 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 36 transitions, 93 flow [2025-04-13 20:57:03,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:57:03,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:03,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:03,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:57:03,838 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:03,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash 886378348, now seen corresponding path program 1 times [2025-04-13 20:57:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:03,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520595058] [2025-04-13 20:57:03,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:57:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:03,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:57:03,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:57:03,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:03,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:57:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:03,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520595058] [2025-04-13 20:57:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520595058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:57:03,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:57:03,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:57:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057937965] [2025-04-13 20:57:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:57:03,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:57:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:03,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:57:03,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:57:03,936 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:57:03,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 36 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:57:03,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:03,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:57:03,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:04,124 INFO L116 PetriNetUnfolderBase]: 894/1254 cut-off events. [2025-04-13 20:57:04,124 INFO L117 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-04-13 20:57:04,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2712 conditions, 1254 events. 894/1254 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4380 event pairs, 306 based on Foata normal form. 20/940 useless extension candidates. Maximal degree in co-relation 921. Up to 912 conditions per place. [2025-04-13 20:57:04,132 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 57 selfloop transitions, 6 changer transitions 6/71 dead transitions. [2025-04-13 20:57:04,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 71 transitions, 316 flow [2025-04-13 20:57:04,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:57:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:57:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-04-13 20:57:04,134 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-04-13 20:57:04,135 INFO L175 Difference]: Start difference. First operand has 31 places, 36 transitions, 93 flow. Second operand 4 states and 88 transitions. [2025-04-13 20:57:04,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 71 transitions, 316 flow [2025-04-13 20:57:04,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 71 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:57:04,136 INFO L231 Difference]: Finished difference. Result has 35 places, 40 transitions, 133 flow [2025-04-13 20:57:04,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=35, PETRI_TRANSITIONS=40} [2025-04-13 20:57:04,137 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-04-13 20:57:04,137 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 40 transitions, 133 flow [2025-04-13 20:57:04,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:57:04,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:04,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:04,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:57:04,137 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:04,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1106656348, now seen corresponding path program 2 times [2025-04-13 20:57:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:04,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272253792] [2025-04-13 20:57:04,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:57:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:04,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:57:04,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:57:04,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:57:04,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:57:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:04,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272253792] [2025-04-13 20:57:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272253792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:57:04,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136119375] [2025-04-13 20:57:04,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:57:04,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:57:04,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:57:04,222 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:57:04,224 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:57:04,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:57:04,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:57:04,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:57:04,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:04,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 20:57:04,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:57:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:57:04,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:57:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:57:04,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136119375] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:57:04,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:57:04,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-13 20:57:04,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842822690] [2025-04-13 20:57:04,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:57:04,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:57:04,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:04,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:57:04,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:57:04,350 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:57:04,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 40 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:57:04,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:04,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:57:04,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:04,573 INFO L116 PetriNetUnfolderBase]: 759/1193 cut-off events. [2025-04-13 20:57:04,573 INFO L117 PetriNetUnfolderBase]: For 813/813 co-relation queries the response was YES. [2025-04-13 20:57:04,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3007 conditions, 1193 events. 759/1193 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5108 event pairs, 72 based on Foata normal form. 139/1159 useless extension candidates. Maximal degree in co-relation 1108. Up to 520 conditions per place. [2025-04-13 20:57:04,579 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 73 selfloop transitions, 12 changer transitions 2/89 dead transitions. [2025-04-13 20:57:04,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 89 transitions, 447 flow [2025-04-13 20:57:04,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:57:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:57:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-04-13 20:57:04,581 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5219298245614035 [2025-04-13 20:57:04,581 INFO L175 Difference]: Start difference. First operand has 35 places, 40 transitions, 133 flow. Second operand 6 states and 119 transitions. [2025-04-13 20:57:04,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 89 transitions, 447 flow [2025-04-13 20:57:04,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 89 transitions, 441 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 20:57:04,584 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 221 flow [2025-04-13 20:57:04,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-04-13 20:57:04,584 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2025-04-13 20:57:04,584 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 221 flow [2025-04-13 20:57:04,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:57:04,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:04,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:04,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:57:04,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:57:04,793 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:04,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash 103617302, now seen corresponding path program 3 times [2025-04-13 20:57:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:04,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687618170] [2025-04-13 20:57:04,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:57:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:04,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:57:04,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:57:04,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:57:04,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:57:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:04,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687618170] [2025-04-13 20:57:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687618170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:57:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:57:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:57:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405267821] [2025-04-13 20:57:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:57:04,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:57:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:04,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:57:04,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:57:04,870 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:57:04,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:57:04,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:04,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:57:04,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:05,018 INFO L116 PetriNetUnfolderBase]: 737/1163 cut-off events. [2025-04-13 20:57:05,018 INFO L117 PetriNetUnfolderBase]: For 2230/2230 co-relation queries the response was YES. [2025-04-13 20:57:05,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 1163 events. 737/1163 cut-off events. For 2230/2230 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4782 event pairs, 291 based on Foata normal form. 23/1009 useless extension candidates. Maximal degree in co-relation 2418. Up to 969 conditions per place. [2025-04-13 20:57:05,025 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 40 selfloop transitions, 0 changer transitions 19/61 dead transitions. [2025-04-13 20:57:05,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 413 flow [2025-04-13 20:57:05,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:57:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:57:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-13 20:57:05,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-04-13 20:57:05,027 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 221 flow. Second operand 4 states and 72 transitions. [2025-04-13 20:57:05,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 413 flow [2025-04-13 20:57:05,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 397 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:57:05,033 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 190 flow [2025-04-13 20:57:05,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-04-13 20:57:05,034 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2025-04-13 20:57:05,034 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 190 flow [2025-04-13 20:57:05,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:57:05,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:05,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:05,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:57:05,035 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:05,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1253095683, now seen corresponding path program 1 times [2025-04-13 20:57:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:05,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127102271] [2025-04-13 20:57:05,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:57:05,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:05,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:57:05,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:57:05,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:05,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:05,078 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:57:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:05,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127102271] [2025-04-13 20:57:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127102271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:57:05,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:57:05,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:57:05,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416670571] [2025-04-13 20:57:05,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:57:05,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:57:05,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:05,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:57:05,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:57:05,083 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:57:05,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:57:05,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:05,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:57:05,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:05,183 INFO L116 PetriNetUnfolderBase]: 594/972 cut-off events. [2025-04-13 20:57:05,183 INFO L117 PetriNetUnfolderBase]: For 1579/1579 co-relation queries the response was YES. [2025-04-13 20:57:05,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 972 events. 594/972 cut-off events. For 1579/1579 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3952 event pairs, 124 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 2776. Up to 458 conditions per place. [2025-04-13 20:57:05,189 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 47 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-04-13 20:57:05,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 350 flow [2025-04-13 20:57:05,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:57:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:57:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-13 20:57:05,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2025-04-13 20:57:05,190 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 190 flow. Second operand 3 states and 55 transitions. [2025-04-13 20:57:05,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 350 flow [2025-04-13 20:57:05,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 300 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-13 20:57:05,193 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 157 flow [2025-04-13 20:57:05,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2025-04-13 20:57:05,193 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-04-13 20:57:05,193 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 157 flow [2025-04-13 20:57:05,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:57:05,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:05,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:05,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:57:05,196 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:05,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1997748657, now seen corresponding path program 1 times [2025-04-13 20:57:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:05,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718220398] [2025-04-13 20:57:05,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:57:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:05,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:57:05,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:57:05,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:05,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:05,279 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:57:05,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:05,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718220398] [2025-04-13 20:57:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718220398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:57:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:57:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:57:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068480257] [2025-04-13 20:57:05,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:57:05,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:57:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:05,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:57:05,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:57:05,281 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:57:05,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:57:05,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:05,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:57:05,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:05,431 INFO L116 PetriNetUnfolderBase]: 626/1020 cut-off events. [2025-04-13 20:57:05,431 INFO L117 PetriNetUnfolderBase]: For 1351/1351 co-relation queries the response was YES. [2025-04-13 20:57:05,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 1020 events. 626/1020 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3949 event pairs, 268 based on Foata normal form. 34/976 useless extension candidates. Maximal degree in co-relation 2841. Up to 841 conditions per place. [2025-04-13 20:57:05,438 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 36 selfloop transitions, 6 changer transitions 23/67 dead transitions. [2025-04-13 20:57:05,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 365 flow [2025-04-13 20:57:05,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:57:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:57:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-13 20:57:05,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-13 20:57:05,439 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 157 flow. Second operand 5 states and 80 transitions. [2025-04-13 20:57:05,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 365 flow [2025-04-13 20:57:05,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:57:05,442 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 199 flow [2025-04-13 20:57:05,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-04-13 20:57:05,443 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2025-04-13 20:57:05,443 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 199 flow [2025-04-13 20:57:05,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:57:05,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:05,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:05,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:57:05,443 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:05,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash 474897670, now seen corresponding path program 1 times [2025-04-13 20:57:05,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:05,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511680809] [2025-04-13 20:57:05,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:57:05,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:57:05,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:57:05,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:05,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:57:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:05,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511680809] [2025-04-13 20:57:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511680809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:57:05,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593286881] [2025-04-13 20:57:05,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:57:05,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:57:05,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:57:05,549 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:57:05,550 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:57:05,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:57:05,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:57:05,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:05,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:05,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:57:05,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:57:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:57:05,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:57:05,708 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:57:05,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593286881] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:57:05,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:57:05,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-04-13 20:57:05,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948617376] [2025-04-13 20:57:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:57:05,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:57:05,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:05,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:57:05,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:57:05,710 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:57:05,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:57:05,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:05,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:57:05,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:05,843 INFO L116 PetriNetUnfolderBase]: 525/834 cut-off events. [2025-04-13 20:57:05,843 INFO L117 PetriNetUnfolderBase]: For 1117/1117 co-relation queries the response was YES. [2025-04-13 20:57:05,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2333 conditions, 834 events. 525/834 cut-off events. For 1117/1117 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3036 event pairs, 208 based on Foata normal form. 6/750 useless extension candidates. Maximal degree in co-relation 2321. Up to 553 conditions per place. [2025-04-13 20:57:05,850 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-04-13 20:57:05,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 356 flow [2025-04-13 20:57:05,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:57:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:57:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-13 20:57:05,851 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3736842105263158 [2025-04-13 20:57:05,851 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 199 flow. Second operand 5 states and 71 transitions. [2025-04-13 20:57:05,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 356 flow [2025-04-13 20:57:05,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 336 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-13 20:57:05,854 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 186 flow [2025-04-13 20:57:05,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-04-13 20:57:05,854 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2025-04-13 20:57:05,854 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 186 flow [2025-04-13 20:57:05,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:57:05,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:05,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:05,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:57:06,059 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,SelfDestructingSolverStorable6 [2025-04-13 20:57:06,059 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:06,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -367744690, now seen corresponding path program 1 times [2025-04-13 20:57:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:06,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234412436] [2025-04-13 20:57:06,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:57:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:06,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:57:06,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:57:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:57:07,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:07,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234412436] [2025-04-13 20:57:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234412436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:57:07,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982097888] [2025-04-13 20:57:07,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:57:07,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:57:07,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:57:07,037 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:57:07,038 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:57:07,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:57:07,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:57:07,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:07,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:07,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:57:07,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:57:07,408 INFO L325 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-04-13 20:57:07,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-04-13 20:57:08,220 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:57:08,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 499 [2025-04-13 20:57:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:57:12,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:57:52,780 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:57:52,781 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 38 treesize of output 83 [2025-04-13 20:57:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:57:53,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982097888] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:57:53,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:57:53,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 25 [2025-04-13 20:57:53,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64963298] [2025-04-13 20:57:53,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:57:53,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:57:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:53,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:57:53,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=596, Unknown=3, NotChecked=0, Total=702 [2025-04-13 20:57:57,512 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:57,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-13 20:57:57,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 186 flow. Second operand has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 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:57:57,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:57,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-13 20:57:57,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:58,865 INFO L116 PetriNetUnfolderBase]: 1312/1917 cut-off events. [2025-04-13 20:57:58,866 INFO L117 PetriNetUnfolderBase]: For 2751/2757 co-relation queries the response was YES. [2025-04-13 20:57:58,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5506 conditions, 1917 events. 1312/1917 cut-off events. For 2751/2757 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7575 event pairs, 46 based on Foata normal form. 1/1733 useless extension candidates. Maximal degree in co-relation 5495. Up to 894 conditions per place. [2025-04-13 20:57:58,873 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 127 selfloop transitions, 42 changer transitions 1/171 dead transitions. [2025-04-13 20:57:58,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 171 transitions, 972 flow [2025-04-13 20:57:58,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:57:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:57:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2025-04-13 20:57:58,875 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3912280701754386 [2025-04-13 20:57:58,875 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 186 flow. Second operand 15 states and 223 transitions. [2025-04-13 20:57:58,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 171 transitions, 972 flow [2025-04-13 20:57:58,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 171 transitions, 930 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-13 20:57:58,880 INFO L231 Difference]: Finished difference. Result has 65 places, 79 transitions, 518 flow [2025-04-13 20:57:58,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=518, PETRI_PLACES=65, PETRI_TRANSITIONS=79} [2025-04-13 20:57:58,881 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-04-13 20:57:58,881 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 79 transitions, 518 flow [2025-04-13 20:57:58,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 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:57:58,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:58,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:58,889 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:57:59,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:57:59,082 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:59,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1398906166, now seen corresponding path program 2 times [2025-04-13 20:57:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:59,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668278500] [2025-04-13 20:57:59,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:57:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:59,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:57:59,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 20:57:59,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:57:59,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:57:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:59,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668278500] [2025-04-13 20:57:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668278500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:57:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:57:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:57:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201863922] [2025-04-13 20:57:59,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:57:59,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:57:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:59,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:57:59,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:57:59,207 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2025-04-13 20:57:59,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 79 transitions, 518 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:57:59,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:59,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2025-04-13 20:57:59,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:59,462 INFO L116 PetriNetUnfolderBase]: 1737/2454 cut-off events. [2025-04-13 20:57:59,462 INFO L117 PetriNetUnfolderBase]: For 5539/5539 co-relation queries the response was YES. [2025-04-13 20:57:59,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9106 conditions, 2454 events. 1737/2454 cut-off events. For 5539/5539 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9414 event pairs, 324 based on Foata normal form. 0/2123 useless extension candidates. Maximal degree in co-relation 9088. Up to 1910 conditions per place. [2025-04-13 20:57:59,475 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 119 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2025-04-13 20:57:59,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 1212 flow [2025-04-13 20:57:59,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:57:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:57:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-13 20:57:59,477 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37719298245614036 [2025-04-13 20:57:59,477 INFO L175 Difference]: Start difference. First operand has 65 places, 79 transitions, 518 flow. Second operand 6 states and 86 transitions. [2025-04-13 20:57:59,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 1212 flow [2025-04-13 20:57:59,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 139 transitions, 1028 flow, removed 86 selfloop flow, removed 2 redundant places. [2025-04-13 20:57:59,497 INFO L231 Difference]: Finished difference. Result has 72 places, 95 transitions, 605 flow [2025-04-13 20:57:59,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=72, PETRI_TRANSITIONS=95} [2025-04-13 20:57:59,498 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2025-04-13 20:57:59,498 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 95 transitions, 605 flow [2025-04-13 20:57:59,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:57:59,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:59,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:59,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:57:59,498 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:57:59,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash -260385836, now seen corresponding path program 3 times [2025-04-13 20:57:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:59,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26636222] [2025-04-13 20:57:59,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:57:59,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:59,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:57:59,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:57:59,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:57:59,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:00,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:00,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26636222] [2025-04-13 20:58:00,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26636222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:00,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902811375] [2025-04-13 20:58:00,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:58:00,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:00,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:00,225 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:58:00,227 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:58:00,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:58:00,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:58:00,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:58:00,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:00,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:58:00,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:00,612 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-13 20:58:00,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2025-04-13 20:58:01,044 INFO L325 Elim1Store]: treesize reduction 72, result has 71.1 percent of original size [2025-04-13 20:58:01,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 120 treesize of output 244 [2025-04-13 20:58:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:01,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:05,517 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (= (mod (+ c_~asum~0 c_~bsum~0) 4294967296) (mod (+ c_~csum~0 (select (let ((.cse0 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (select |c_#memory_int#1| ~C~0.base) (+ ~C~0.offset .cse0) (+ (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int#1| c_~B~0.base) (+ c_~B~0.offset .cse0))))) (+ (* c_thread3Thread1of1ForFork0_~i~2 4) ~C~0.offset))) 4294967296))) is different from false [2025-04-13 20:58:18,176 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:58:18,177 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 38 treesize of output 83 [2025-04-13 20:58:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902811375] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:18,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 25 [2025-04-13 20:58:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112135705] [2025-04-13 20:58:18,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:18,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:58:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:18,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:58:18,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=551, Unknown=2, NotChecked=48, Total=702 [2025-04-13 20:58:18,621 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-13 20:58:18,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 95 transitions, 605 flow. Second operand has 27 states, 27 states have (on average 6.851851851851852) internal successors, (185), 27 states have internal predecessors, (185), 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:58:18,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:18,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-13 20:58:18,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:19,998 INFO L116 PetriNetUnfolderBase]: 2227/3218 cut-off events. [2025-04-13 20:58:19,998 INFO L117 PetriNetUnfolderBase]: For 6183/6191 co-relation queries the response was YES. [2025-04-13 20:58:20,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12128 conditions, 3218 events. 2227/3218 cut-off events. For 6183/6191 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13985 event pairs, 141 based on Foata normal form. 7/2882 useless extension candidates. Maximal degree in co-relation 12105. Up to 1603 conditions per place. [2025-04-13 20:58:20,025 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 184 selfloop transitions, 73 changer transitions 1/259 dead transitions. [2025-04-13 20:58:20,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 259 transitions, 2011 flow [2025-04-13 20:58:20,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:58:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:58:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2025-04-13 20:58:20,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41353383458646614 [2025-04-13 20:58:20,027 INFO L175 Difference]: Start difference. First operand has 72 places, 95 transitions, 605 flow. Second operand 14 states and 220 transitions. [2025-04-13 20:58:20,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 259 transitions, 2011 flow [2025-04-13 20:58:20,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 259 transitions, 1949 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-04-13 20:58:20,051 INFO L231 Difference]: Finished difference. Result has 89 places, 151 transitions, 1201 flow [2025-04-13 20:58:20,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1201, PETRI_PLACES=89, PETRI_TRANSITIONS=151} [2025-04-13 20:58:20,052 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places. [2025-04-13 20:58:20,052 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 151 transitions, 1201 flow [2025-04-13 20:58:20,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.851851851851852) internal successors, (185), 27 states have internal predecessors, (185), 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:58:20,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:20,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:20,060 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:58:20,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:20,253 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:58:20,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash -613713530, now seen corresponding path program 4 times [2025-04-13 20:58:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:20,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098671300] [2025-04-13 20:58:20,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:58:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:20,260 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:58:20,280 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:58:20,280 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:58:20,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:58:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:20,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098671300] [2025-04-13 20:58:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098671300] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:20,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44670864] [2025-04-13 20:58:20,717 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:58:20,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:20,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:20,719 INFO L229 MonitoredProcess]: Starting monitored process 6 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:58:20,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:58:20,765 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:58:20,790 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:58:20,790 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:58:20,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:20,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:58:20,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:21,100 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-13 20:58:21,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2025-04-13 20:58:21,559 INFO L325 Elim1Store]: treesize reduction 72, result has 71.1 percent of original size [2025-04-13 20:58:21,559 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 120 treesize of output 244 [2025-04-13 20:58:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:21,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:26,186 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (= (mod (+ c_~asum~0 c_~bsum~0) 4294967296) (mod (+ c_~csum~0 (select (let ((.cse0 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (select |c_#memory_int#1| ~C~0.base) (+ ~C~0.offset .cse0) (+ (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int#1| c_~B~0.base) (+ c_~B~0.offset .cse0))))) (+ (* c_thread3Thread1of1ForFork0_~i~2 4) ~C~0.offset))) 4294967296))) is different from false [2025-04-13 20:58:54,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:58:54,478 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 38 treesize of output 83 [2025-04-13 20:58:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44670864] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:56,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:56,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 22 [2025-04-13 20:58:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772502216] [2025-04-13 20:58:56,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:56,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:58:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:56,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:58:56,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=410, Unknown=7, NotChecked=42, Total=552 [2025-04-13 20:58:56,836 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-13 20:58:56,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 151 transitions, 1201 flow. Second operand has 24 states, 24 states have (on average 7.375) internal successors, (177), 24 states have internal predecessors, (177), 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:58:56,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:56,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-13 20:58:56,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:58,595 INFO L116 PetriNetUnfolderBase]: 2656/3860 cut-off events. [2025-04-13 20:58:58,595 INFO L117 PetriNetUnfolderBase]: For 9258/9274 co-relation queries the response was YES. [2025-04-13 20:58:58,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16129 conditions, 3860 events. 2656/3860 cut-off events. For 9258/9274 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17621 event pairs, 195 based on Foata normal form. 17/3477 useless extension candidates. Maximal degree in co-relation 16101. Up to 2295 conditions per place. [2025-04-13 20:58:58,621 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 182 selfloop transitions, 60 changer transitions 1/244 dead transitions. [2025-04-13 20:58:58,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 244 transitions, 2197 flow [2025-04-13 20:58:58,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:58:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:58:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2025-04-13 20:58:58,623 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39952153110047844 [2025-04-13 20:58:58,623 INFO L175 Difference]: Start difference. First operand has 89 places, 151 transitions, 1201 flow. Second operand 11 states and 167 transitions. [2025-04-13 20:58:58,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 244 transitions, 2197 flow [2025-04-13 20:58:58,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 244 transitions, 2057 flow, removed 69 selfloop flow, removed 1 redundant places. [2025-04-13 20:58:58,707 INFO L231 Difference]: Finished difference. Result has 101 places, 165 transitions, 1354 flow [2025-04-13 20:58:58,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1354, PETRI_PLACES=101, PETRI_TRANSITIONS=165} [2025-04-13 20:58:58,707 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 67 predicate places. [2025-04-13 20:58:58,707 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 165 transitions, 1354 flow [2025-04-13 20:58:58,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.375) internal successors, (177), 24 states have internal predecessors, (177), 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:58:58,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:58,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:58,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:58:58,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 20:58:58,912 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:58:58,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash 593158086, now seen corresponding path program 5 times [2025-04-13 20:58:58,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:58,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19755708] [2025-04-13 20:58:58,913 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:58:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:58,919 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:58:58,944 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:58:58,945 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:58:58,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:59:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:00,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19755708] [2025-04-13 20:59:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19755708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:00,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138862443] [2025-04-13 20:59:00,070 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:00,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:00,073 INFO L229 MonitoredProcess]: Starting monitored process 7 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:59:00,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:59:00,118 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:59:00,214 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:59:00,214 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:00,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:00,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 20:59:00,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:00,229 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:59:00,322 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 20:59:00,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 20:59:00,435 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 20:59:00,435 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 16 treesize of output 18 [2025-04-13 20:59:00,865 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 20:59:00,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:59:01,350 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:59:01,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-04-13 20:59:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:59:01,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:01,736 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:59:01,736 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 356 treesize of output 336 [2025-04-13 20:59:02,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 75 treesize of output 73 [2025-04-13 20:59:03,591 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:59:03,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 87 [2025-04-13 20:59:03,627 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:59:03,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 45 [2025-04-13 20:59:04,333 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 51 treesize of output 43 [2025-04-13 20:59:04,357 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 250 treesize of output 210 [2025-04-13 20:59:23,984 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 24 treesize of output 20 [2025-04-13 20:59:23,992 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 69 treesize of output 57 [2025-04-13 20:59:24,983 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 47 treesize of output 39 [2025-04-13 20:59:24,997 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 87 treesize of output 71 [2025-04-13 20:59:26,201 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 71 treesize of output 59 [2025-04-13 20:59:26,229 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 302 treesize of output 250 [2025-04-13 20:59:26,466 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 47 treesize of output 39 [2025-04-13 20:59:26,482 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 153 treesize of output 129 [2025-04-13 20:59:26,545 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 97 treesize of output 81 [2025-04-13 20:59:26,592 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 129 treesize of output 105 [2025-04-13 20:59:35,428 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 71 treesize of output 59 [2025-04-13 20:59:35,465 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 429 treesize of output 361 [2025-04-13 20:59:35,783 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 22 treesize of output 18 [2025-04-13 20:59:35,791 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 65 treesize of output 53 [2025-04-13 20:59:36,405 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 22 treesize of output 18 [2025-04-13 20:59:36,413 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 65 treesize of output 53 [2025-04-13 20:59:36,974 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 47 treesize of output 39 [2025-04-13 20:59:36,987 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 87 treesize of output 71 [2025-04-13 20:59:37,581 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 22 treesize of output 18 [2025-04-13 20:59:37,592 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 65 treesize of output 53 [2025-04-13 20:59:38,275 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 47 treesize of output 39 [2025-04-13 20:59:38,289 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 234 treesize of output 194 [2025-04-13 20:59:38,458 INFO L325 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2025-04-13 20:59:38,458 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 251 treesize of output 1 [2025-04-13 20:59:38,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:59:38,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:59:38,472 INFO L325 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-04-13 20:59:38,473 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 38 treesize of output 1 [2025-04-13 20:59:38,492 INFO L325 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2025-04-13 20:59:38,492 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 163 treesize of output 1 [2025-04-13 20:59:38,663 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:59:38,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 149 [2025-04-13 20:59:39,299 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:59:39,299 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 22 treesize of output 1 [2025-04-13 20:59:39,314 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:59:39,314 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 24 treesize of output 25 [2025-04-13 20:59:39,963 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:59:39,963 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 47 treesize of output 1 [2025-04-13 20:59:39,967 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:59:39,969 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:59:39,971 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:59:40,024 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:59:40,025 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 97 treesize of output 1 [2025-04-13 20:59:40,041 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:59:40,041 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 47 treesize of output 1 [2025-04-13 20:59:40,052 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:59:40,052 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 22 treesize of output 1 [2025-04-13 20:59:40,063 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:59:40,064 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 47 treesize of output 1 [2025-04-13 20:59:40,082 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:59:40,082 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 71 treesize of output 1 [2025-04-13 20:59:40,285 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:59:40,286 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 251 treesize of output 225 [2025-04-13 20:59:40,782 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:59,915 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 34 DAG size of output: 28 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-04-13 21:04:17,409 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:04:23,624 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:06:59,517 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:07:49,402 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:09:06,259 WARN L286 SmtUtils]: Spent 8.74s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-13 21:11:24,909 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:11:24,913 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:11:24,932 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 21:11:24,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 21:11:25,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:11:25,137 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-6-2-1 context. [2025-04-13 21:11:25,138 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 21:11:25,138 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 21:11:25,139 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 21:11:25,139 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2025-04-13 21:11:25,141 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:11:25,141 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:11:25,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:11:25 BasicIcfg [2025-04-13 21:11:25,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:11:25,144 INFO L158 Benchmark]: Toolchain (without parser) took 863227.89ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 99.4MB in the beginning and 85.7MB in the end (delta: 13.7MB). Peak memory consumption was 389.5MB. Max. memory is 8.0GB. [2025-04-13 21:11:25,145 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:11:25,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.84ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 83.9MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:11:25,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:11:25,145 INFO L158 Benchmark]: Boogie Preprocessor took 40.62ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 79.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:11:25,145 INFO L158 Benchmark]: RCFGBuilder took 609.19ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 91.0MB in the end (delta: -11.3MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. [2025-04-13 21:11:25,146 INFO L158 Benchmark]: TraceAbstraction took 862280.59ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 91.0MB in the beginning and 85.7MB in the end (delta: 5.4MB). Peak memory consumption was 382.6MB. Max. memory is 8.0GB. [2025-04-13 21:11:25,147 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.15ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.84ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 83.9MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.62ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 79.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 609.19ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 91.0MB in the end (delta: -11.3MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. * TraceAbstraction took 862280.59ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 91.0MB in the beginning and 85.7MB in the end (delta: 5.4MB). Peak memory consumption was 382.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-6-2-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-6-2-1 context. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-6-2-1 context. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-22-3-6-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 45 locations, 61 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 862.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 721 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 285 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3969 IncrementalHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 11 mSDtfsCounter, 3969 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 217 SyntacticMatches, 6 SemanticMatches, 122 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 91.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1354occurred in iteration=11, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 103.6s InterpolantComputationTime, 391 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 500 ConstructedInterpolants, 21 QuantifiedInterpolants, 5923 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1265 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 40/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown