/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-bad-dot-product-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:22:03,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:22:03,238 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:22:03,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:22:03,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:22:03,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:22:03,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:22:03,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:22:03,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:22:03,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:22:03,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:22:03,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:22:03,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:22:03,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:22:03,263 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:22:03,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:22:03,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:22:03,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:22:03,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:22:03,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:22:03,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:22:03,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:22:03,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:22:03,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:22:03,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:22:03,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:22:03,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:22:03,266 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:22:03,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:22:03,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:22:03,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:22:03,499 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:22:03,499 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:22:03,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2025-04-13 20:22:04,840 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca1f5d0d/6914250fcb7144dca0362887e4f54272/FLAGbf73c689c [2025-04-13 20:22:05,057 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:22:05,057 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2025-04-13 20:22:05,065 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca1f5d0d/6914250fcb7144dca0362887e4f54272/FLAGbf73c689c [2025-04-13 20:22:05,840 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca1f5d0d/6914250fcb7144dca0362887e4f54272 [2025-04-13 20:22:05,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:22:05,843 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:22:05,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:22:05,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:22:05,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:22:05,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:22:05" (1/1) ... [2025-04-13 20:22:05,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97acdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:05, skipping insertion in model container [2025-04-13 20:22:05,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:22:05" (1/1) ... [2025-04-13 20:22:05,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:22:06,023 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-bad-dot-product-alt.wvr.c[3221,3234] [2025-04-13 20:22:06,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:22:06,037 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:22:06,078 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-bad-dot-product-alt.wvr.c[3221,3234] [2025-04-13 20:22:06,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:22:06,090 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:22:06,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06 WrapperNode [2025-04-13 20:22:06,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:22:06,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:22:06,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:22:06,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:22:06,095 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:22:06" (1/1) ... [2025-04-13 20:22:06,105 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:22:06" (1/1) ... [2025-04-13 20:22:06,132 INFO L138 Inliner]: procedures = 27, calls = 59, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 339 [2025-04-13 20:22:06,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:22:06,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:22:06,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:22:06,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:22:06,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,159 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 4, 24]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 1, 3]. [2025-04-13 20:22:06,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:22:06,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:22:06,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:22:06,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:22:06,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (1/1) ... [2025-04-13 20:22:06,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:22:06,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:06,218 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:22:06,220 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:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 20:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 20:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 20:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 20:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:22:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:22:06,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:22:06,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:22:06,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:22:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:22:06,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:22:06,237 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:22:06,353 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:22:06,354 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:22:06,737 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:22:06,737 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:22:06,737 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:22:07,147 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:22:07,153 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:22:07,163 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:22:07,168 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:22:07,176 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:22:07,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:22:07 BoogieIcfgContainer [2025-04-13 20:22:07,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:22:07,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:22:07,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:22:07,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:22:07,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:22:05" (1/3) ... [2025-04-13 20:22:07,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d12739f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:22:07, skipping insertion in model container [2025-04-13 20:22:07,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:06" (2/3) ... [2025-04-13 20:22:07,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d12739f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:22:07, skipping insertion in model container [2025-04-13 20:22:07,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:22:07" (3/3) ... [2025-04-13 20:22:07,183 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2025-04-13 20:22:07,193 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:22:07,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-dot-product-alt.wvr.c that has 4 procedures, 28 locations, 34 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-13 20:22:07,194 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:22:07,275 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:22:07,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 37 transitions, 95 flow [2025-04-13 20:22:07,333 INFO L116 PetriNetUnfolderBase]: 10/34 cut-off events. [2025-04-13 20:22:07,335 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:22:07,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 10/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-04-13 20:22:07,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 37 transitions, 95 flow [2025-04-13 20:22:07,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 33 transitions, 84 flow [2025-04-13 20:22:07,352 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:22:07,362 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;@3238ab33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:22:07,362 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:22:07,380 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:22:07,380 INFO L116 PetriNetUnfolderBase]: 10/32 cut-off events. [2025-04-13 20:22:07,380 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:22:07,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:07,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:07,381 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:22:07,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1262259320, now seen corresponding path program 1 times [2025-04-13 20:22:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:07,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375004036] [2025-04-13 20:22:07,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:07,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:07,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:22:07,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:22:07,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:07,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:07,668 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:22:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:07,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375004036] [2025-04-13 20:22:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375004036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:07,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:22:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237360891] [2025-04-13 20:22:07,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:07,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:22:07,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:07,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:22:07,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:22:07,697 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:22:07,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:22:07,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:07,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:22:07,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:07,935 INFO L116 PetriNetUnfolderBase]: 519/713 cut-off events. [2025-04-13 20:22:07,935 INFO L117 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-04-13 20:22:07,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 713 events. 519/713 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1966 event pairs, 306 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 1324. Up to 707 conditions per place. [2025-04-13 20:22:07,943 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-04-13 20:22:07,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 146 flow [2025-04-13 20:22:07,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:22:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:22:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 20:22:07,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-13 20:22:07,954 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 84 flow. Second operand 3 states and 42 transitions. [2025-04-13 20:22:07,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 146 flow [2025-04-13 20:22:07,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:22:07,960 INFO L231 Difference]: Finished difference. Result has 29 places, 32 transitions, 74 flow [2025-04-13 20:22:07,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=32} [2025-04-13 20:22:07,966 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2025-04-13 20:22:07,966 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 32 transitions, 74 flow [2025-04-13 20:22:07,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:22:07,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:07,967 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:22:07,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:22:07,967 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:22:07,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash 392141516, now seen corresponding path program 1 times [2025-04-13 20:22:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:07,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109441265] [2025-04-13 20:22:07,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:07,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:22:08,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:22:08,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:08,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:08,143 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:22:08,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:08,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109441265] [2025-04-13 20:22:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109441265] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:08,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:08,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:22:08,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372926563] [2025-04-13 20:22:08,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:08,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:22:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:08,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:22:08,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:22:08,144 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:22:08,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:22:08,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:08,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:22:08,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:08,301 INFO L116 PetriNetUnfolderBase]: 477/671 cut-off events. [2025-04-13 20:22:08,302 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 20:22:08,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 671 events. 477/671 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1869 event pairs, 306 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 1347. Up to 665 conditions per place. [2025-04-13 20:22:08,306 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-13 20:22:08,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 134 flow [2025-04-13 20:22:08,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:22:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:22:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 20:22:08,307 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36936936936936937 [2025-04-13 20:22:08,307 INFO L175 Difference]: Start difference. First operand has 29 places, 32 transitions, 74 flow. Second operand 3 states and 41 transitions. [2025-04-13 20:22:08,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 134 flow [2025-04-13 20:22:08,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:22:08,308 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 74 flow [2025-04-13 20:22:08,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2025-04-13 20:22:08,308 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2025-04-13 20:22:08,308 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 74 flow [2025-04-13 20:22:08,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:22:08,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:08,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:08,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:22:08,309 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:22:08,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1175338826, now seen corresponding path program 1 times [2025-04-13 20:22:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:08,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841886110] [2025-04-13 20:22:08,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:08,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:08,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:22:08,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:22:08,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:08,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:08,494 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:22:08,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:08,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841886110] [2025-04-13 20:22:08,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841886110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:08,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:08,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:22:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543252826] [2025-04-13 20:22:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:08,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:22:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:08,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:22:08,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:22:08,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:22:08,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:08,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:08,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:22:08,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:08,704 INFO L116 PetriNetUnfolderBase]: 479/677 cut-off events. [2025-04-13 20:22:08,704 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 20:22:08,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 677 events. 479/677 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1871 event pairs, 306 based on Foata normal form. 3/509 useless extension candidates. Maximal degree in co-relation 1347. Up to 672 conditions per place. [2025-04-13 20:22:08,708 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 29 selfloop transitions, 4 changer transitions 4/37 dead transitions. [2025-04-13 20:22:08,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 160 flow [2025-04-13 20:22:08,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:22:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:22:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-04-13 20:22:08,709 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3027027027027027 [2025-04-13 20:22:08,709 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 74 flow. Second operand 5 states and 56 transitions. [2025-04-13 20:22:08,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 160 flow [2025-04-13 20:22:08,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:22:08,711 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 104 flow [2025-04-13 20:22:08,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2025-04-13 20:22:08,712 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2025-04-13 20:22:08,713 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 104 flow [2025-04-13 20:22:08,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:08,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:08,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:08,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:22:08,713 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:22:08,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash 658676634, now seen corresponding path program 1 times [2025-04-13 20:22:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:08,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697075057] [2025-04-13 20:22:08,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:08,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:22:08,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:22:08,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:08,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:22:09,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:09,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697075057] [2025-04-13 20:22:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697075057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:09,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:09,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:22:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121338951] [2025-04-13 20:22:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:09,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:22:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:09,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:22:09,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:22:09,031 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:22:09,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:09,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:09,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:22:09,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:09,171 INFO L116 PetriNetUnfolderBase]: 479/686 cut-off events. [2025-04-13 20:22:09,171 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 20:22:09,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 686 events. 479/686 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1941 event pairs, 309 based on Foata normal form. 14/531 useless extension candidates. Maximal degree in co-relation 1398. Up to 667 conditions per place. [2025-04-13 20:22:09,176 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 30 selfloop transitions, 2 changer transitions 8/40 dead transitions. [2025-04-13 20:22:09,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 201 flow [2025-04-13 20:22:09,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:22:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:22:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-04-13 20:22:09,178 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-04-13 20:22:09,178 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 104 flow. Second operand 3 states and 50 transitions. [2025-04-13 20:22:09,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 201 flow [2025-04-13 20:22:09,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 189 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:22:09,180 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 98 flow [2025-04-13 20:22:09,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-04-13 20:22:09,181 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2025-04-13 20:22:09,181 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 98 flow [2025-04-13 20:22:09,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:09,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:09,181 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:22:09,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:22:09,181 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:22:09,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash 212970917, now seen corresponding path program 1 times [2025-04-13 20:22:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:09,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308072633] [2025-04-13 20:22:09,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:09,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:09,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:22:09,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:22:09,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:09,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:22:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:09,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308072633] [2025-04-13 20:22:09,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308072633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:09,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:22:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166523976] [2025-04-13 20:22:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:09,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:22:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:09,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:22:09,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:22:09,454 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:22:09,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:22:09,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:09,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:22:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:09,597 INFO L116 PetriNetUnfolderBase]: 479/687 cut-off events. [2025-04-13 20:22:09,597 INFO L117 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-04-13 20:22:09,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 687 events. 479/687 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1941 event pairs, 309 based on Foata normal form. 18/579 useless extension candidates. Maximal degree in co-relation 1512. Up to 667 conditions per place. [2025-04-13 20:22:09,600 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 27 selfloop transitions, 6 changer transitions 8/41 dead transitions. [2025-04-13 20:22:09,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 203 flow [2025-04-13 20:22:09,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:22:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:22:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-04-13 20:22:09,601 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31891891891891894 [2025-04-13 20:22:09,601 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 98 flow. Second operand 5 states and 59 transitions. [2025-04-13 20:22:09,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 203 flow [2025-04-13 20:22:09,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:22:09,603 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 124 flow [2025-04-13 20:22:09,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-13 20:22:09,604 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-04-13 20:22:09,604 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 124 flow [2025-04-13 20:22:09,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:22:09,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:09,604 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:22:09,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:22:09,604 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:22:09,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash 258663600, now seen corresponding path program 1 times [2025-04-13 20:22:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:09,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450458909] [2025-04-13 20:22:09,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:09,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:22:09,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:22:09,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:09,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:11,504 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:22:11,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:11,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450458909] [2025-04-13 20:22:11,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450458909] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:22:11,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384179901] [2025-04-13 20:22:11,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:11,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:22:11,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:11,507 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:22:11,508 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:22:11,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:22:11,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:22:11,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:11,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:11,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-13 20:22:11,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:22:11,699 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:22:11,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:22:11,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:22:11,786 INFO L325 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2025-04-13 20:22:11,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 20:22:11,806 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 20:22:11,820 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-13 20:22:11,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 24 [2025-04-13 20:22:12,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:22:12,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:22:12,152 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:22:12,273 INFO L325 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-04-13 20:22:12,274 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 2 case distinctions, treesize of input 78 treesize of output 84 [2025-04-13 20:22:12,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:22:12,467 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:22:13,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2025-04-13 20:22:13,241 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 20:22:13,242 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 2 case distinctions, treesize of input 45 treesize of output 33 [2025-04-13 20:22:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:22:13,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:22:14,141 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:22:14,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 264 [2025-04-13 20:22:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:22:14,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384179901] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:22:14,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:22:14,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 28 [2025-04-13 20:22:14,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245883946] [2025-04-13 20:22:14,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:22:14,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:22:14,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:14,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:22:14,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-04-13 20:22:14,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:22:14,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 124 flow. Second operand has 30 states, 30 states have (on average 5.166666666666667) internal successors, (155), 30 states have internal predecessors, (155), 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:22:14,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:14,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:22:14,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:37,347 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:22:42,170 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:22:47,279 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:22:51,334 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:23:16,734 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:23:20,825 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:23:24,951 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:23:29,471 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:23:29,995 INFO L116 PetriNetUnfolderBase]: 1604/2361 cut-off events. [2025-04-13 20:23:29,995 INFO L117 PetriNetUnfolderBase]: For 908/908 co-relation queries the response was YES. [2025-04-13 20:23:29,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5562 conditions, 2361 events. 1604/2361 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10399 event pairs, 17 based on Foata normal form. 2/2041 useless extension candidates. Maximal degree in co-relation 5526. Up to 1044 conditions per place. [2025-04-13 20:23:30,006 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 198 selfloop transitions, 122 changer transitions 2/322 dead transitions. [2025-04-13 20:23:30,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 322 transitions, 1551 flow [2025-04-13 20:23:30,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 20:23:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-13 20:23:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 450 transitions. [2025-04-13 20:23:30,010 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28957528957528955 [2025-04-13 20:23:30,010 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 124 flow. Second operand 42 states and 450 transitions. [2025-04-13 20:23:30,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 322 transitions, 1551 flow [2025-04-13 20:23:30,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 322 transitions, 1463 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-04-13 20:23:30,019 INFO L231 Difference]: Finished difference. Result has 97 places, 151 transitions, 817 flow [2025-04-13 20:23:30,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=817, PETRI_PLACES=97, PETRI_TRANSITIONS=151} [2025-04-13 20:23:30,022 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 64 predicate places. [2025-04-13 20:23:30,022 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 151 transitions, 817 flow [2025-04-13 20:23:30,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.166666666666667) internal successors, (155), 30 states have internal predecessors, (155), 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:23:30,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:30,022 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:23:30,030 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:23:30,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:23:30,223 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:23:30,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash 701840526, now seen corresponding path program 2 times [2025-04-13 20:23:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:30,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130728260] [2025-04-13 20:23:30,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:30,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:23:30,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-04-13 20:23:30,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:23:30,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:31,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:31,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130728260] [2025-04-13 20:23:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130728260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:31,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:31,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 20:23:31,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579072793] [2025-04-13 20:23:31,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:31,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:23:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:31,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:23:31,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:23:31,046 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:23:31,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 151 transitions, 817 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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:23:31,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:31,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:23:31,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:31,955 INFO L116 PetriNetUnfolderBase]: 1677/2487 cut-off events. [2025-04-13 20:23:31,956 INFO L117 PetriNetUnfolderBase]: For 7771/7771 co-relation queries the response was YES. [2025-04-13 20:23:31,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 2487 events. 1677/2487 cut-off events. For 7771/7771 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11109 event pairs, 209 based on Foata normal form. 1/2278 useless extension candidates. Maximal degree in co-relation 9270. Up to 2214 conditions per place. [2025-04-13 20:23:31,969 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 159 selfloop transitions, 49 changer transitions 1/209 dead transitions. [2025-04-13 20:23:31,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 209 transitions, 1524 flow [2025-04-13 20:23:31,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:23:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:23:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2025-04-13 20:23:31,970 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2864864864864865 [2025-04-13 20:23:31,970 INFO L175 Difference]: Start difference. First operand has 97 places, 151 transitions, 817 flow. Second operand 10 states and 106 transitions. [2025-04-13 20:23:31,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 209 transitions, 1524 flow [2025-04-13 20:23:31,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 209 transitions, 1476 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-04-13 20:23:31,991 INFO L231 Difference]: Finished difference. Result has 109 places, 183 transitions, 1136 flow [2025-04-13 20:23:31,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1136, PETRI_PLACES=109, PETRI_TRANSITIONS=183} [2025-04-13 20:23:31,993 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 76 predicate places. [2025-04-13 20:23:31,993 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 183 transitions, 1136 flow [2025-04-13 20:23:31,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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:23:31,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:31,994 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:23:31,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:23:31,994 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:23:31,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1611244, now seen corresponding path program 3 times [2025-04-13 20:23:31,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:31,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801427361] [2025-04-13 20:23:31,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:23:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:32,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:23:32,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-04-13 20:23:32,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:23:32,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:23:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:32,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801427361] [2025-04-13 20:23:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801427361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:23:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808645456] [2025-04-13 20:23:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:32,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:23:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:32,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:23:32,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:23:32,980 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:23:32,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 183 transitions, 1136 flow. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:32,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:32,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:23:32,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:33,971 INFO L116 PetriNetUnfolderBase]: 1861/2765 cut-off events. [2025-04-13 20:23:33,971 INFO L117 PetriNetUnfolderBase]: For 10700/10700 co-relation queries the response was YES. [2025-04-13 20:23:33,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11173 conditions, 2765 events. 1861/2765 cut-off events. For 10700/10700 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12753 event pairs, 203 based on Foata normal form. 1/2532 useless extension candidates. Maximal degree in co-relation 11115. Up to 2390 conditions per place. [2025-04-13 20:23:33,985 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 181 selfloop transitions, 96 changer transitions 3/280 dead transitions. [2025-04-13 20:23:33,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 280 transitions, 2292 flow [2025-04-13 20:23:33,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:23:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:23:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2025-04-13 20:23:33,987 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31891891891891894 [2025-04-13 20:23:33,987 INFO L175 Difference]: Start difference. First operand has 109 places, 183 transitions, 1136 flow. Second operand 10 states and 118 transitions. [2025-04-13 20:23:33,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 280 transitions, 2292 flow [2025-04-13 20:23:34,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 280 transitions, 2227 flow, removed 31 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:34,011 INFO L231 Difference]: Finished difference. Result has 123 places, 241 transitions, 1835 flow [2025-04-13 20:23:34,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1835, PETRI_PLACES=123, PETRI_TRANSITIONS=241} [2025-04-13 20:23:34,012 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 90 predicate places. [2025-04-13 20:23:34,012 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 241 transitions, 1835 flow [2025-04-13 20:23:34,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:34,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:34,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:34,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:23:34,012 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:23:34,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:34,015 INFO L85 PathProgramCache]: Analyzing trace with hash -12312326, now seen corresponding path program 4 times [2025-04-13 20:23:34,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:34,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738711372] [2025-04-13 20:23:34,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:23:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:34,030 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:23:34,068 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:23:34,068 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:23:34,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:35,261 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:23:35,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:35,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738711372] [2025-04-13 20:23:35,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738711372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:35,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708290042] [2025-04-13 20:23:35,261 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:23:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:35,263 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:23:35,264 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:23:35,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:23:35,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:23:35,391 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:23:35,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:35,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 20:23:35,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:35,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-13 20:23:35,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:23:35,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:23:35,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 20:23:35,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 20:23:35,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 20:23:36,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-04-13 20:23:36,684 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 20:23:36,684 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 29 treesize of output 29 [2025-04-13 20:23:36,700 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:23:36,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:37,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2025-04-13 20:23:37,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:23:37,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2025-04-13 20:23:37,514 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:23:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708290042] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:37,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:37,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 26 [2025-04-13 20:23:37,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167102437] [2025-04-13 20:23:37,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:37,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:23:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:37,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:23:37,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:23:37,515 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:23:37,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 241 transitions, 1835 flow. Second operand has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 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:23:37,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:37,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:23:37,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:42,702 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:23:42,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 20:23:42,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 20:23:42,709 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:23:42,904 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,SelfDestructingSolverStorable8 [2025-04-13 20:23:42,904 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:910) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:784) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:372) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:480) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:277) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:259) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:218) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:175) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:115) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:474) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:477) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 53 more [2025-04-13 20:23:42,909 INFO L158 Benchmark]: Toolchain (without parser) took 97066.08ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 99.9MB in the beginning and 193.3MB in the end (delta: -93.4MB). Peak memory consumption was 297.9MB. Max. memory is 8.0GB. [2025-04-13 20:23:42,909 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:23:42,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.58ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 83.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:23:42,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.67ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 80.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:23:42,910 INFO L158 Benchmark]: Boogie Preprocessor took 59.81ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 77.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:23:42,910 INFO L158 Benchmark]: RCFGBuilder took 983.55ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 84.4MB in the end (delta: -7.2MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2025-04-13 20:23:42,910 INFO L158 Benchmark]: TraceAbstraction took 95730.51ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 84.4MB in the beginning and 193.3MB in the end (delta: -108.9MB). Peak memory consumption was 285.3MB. Max. memory is 8.0GB. [2025-04-13 20:23:42,911 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.58ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 83.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.67ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 80.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 59.81ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 77.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 983.55ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 84.4MB in the end (delta: -7.2MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. * TraceAbstraction took 95730.51ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 84.4MB in the beginning and 193.3MB in the end (delta: -108.9MB). Peak memory consumption was 285.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...