/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/pthread-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:38:27,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:38:27,232 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 19:38:27,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:38:27,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:38:27,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:38:27,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:38:27,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:38:27,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:38:27,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:38:27,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:38:27,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:38:27,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:38:27,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:38:27,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:27,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:38:27,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:27,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:38:27,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:38:27,267 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 19:38:27,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:38:27,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:38:27,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:38:27,512 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:38:27,513 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:38:27,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-04-13 19:38:28,812 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a877277/a91516183e344acc8c245b8229bf31b7/FLAGbc9819941 [2025-04-13 19:38:29,112 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:38:29,112 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-04-13 19:38:29,136 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a877277/a91516183e344acc8c245b8229bf31b7/FLAGbc9819941 [2025-04-13 19:38:29,863 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a877277/a91516183e344acc8c245b8229bf31b7 [2025-04-13 19:38:29,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:38:29,867 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:38:29,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:38:29,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:38:29,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:38:29,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:38:29" (1/1) ... [2025-04-13 19:38:29,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ffa6c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:29, skipping insertion in model container [2025-04-13 19:38:29,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:38:29" (1/1) ... [2025-04-13 19:38:29,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:38:30,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2025-04-13 19:38:30,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2025-04-13 19:38:30,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2025-04-13 19:38:30,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:38:30,516 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:38:30,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2025-04-13 19:38:30,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2025-04-13 19:38:30,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2025-04-13 19:38:30,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:38:30,695 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:38:30,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30 WrapperNode [2025-04-13 19:38:30,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:38:30,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:38:30,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:38:30,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:38:30,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,788 INFO L138 Inliner]: procedures = 491, calls = 156, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1847 [2025-04-13 19:38:30,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:38:30,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:38:30,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:38:30,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:38:30,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,891 INFO L175 MemorySlicer]: Split 311 memory accesses to 9 slices as follows [2, 12, 195, 80, 2, 8, 4, 6, 2]. 63 percent of accesses are in the largest equivalence class. The 54 initializations are split as follows [2, 4, 26, 20, 0, 2, 0, 0, 0]. The 95 writes are split as follows [0, 4, 61, 20, 1, 2, 2, 4, 1]. [2025-04-13 19:38:30,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:30,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:31,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:38:31,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:38:31,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:38:31,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:38:31,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (1/1) ... [2025-04-13 19:38:31,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:31,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:31,030 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 19:38:31,032 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 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2025-04-13 19:38:31,050 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-04-13 19:38:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-04-13 19:38:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:38:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:38:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-04-13 19:38:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-04-13 19:38:31,056 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 19:38:31,366 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:38:31,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:38:32,883 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:38:32,885 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:38:32,885 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:38:34,069 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,115 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,123 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,124 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,129 WARN L179 LargeBlockEncoding]: Complex 4:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,136 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,143 WARN L179 LargeBlockEncoding]: Complex 6:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,158 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,161 WARN L179 LargeBlockEncoding]: Complex 7:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:34,170 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:38:34,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:38:34 BoogieIcfgContainer [2025-04-13 19:38:34,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:38:34,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:38:34,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:38:34,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:38:34,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:38:29" (1/3) ... [2025-04-13 19:38:34,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e61bea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:38:34, skipping insertion in model container [2025-04-13 19:38:34,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:30" (2/3) ... [2025-04-13 19:38:34,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e61bea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:38:34, skipping insertion in model container [2025-04-13 19:38:34,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:38:34" (3/3) ... [2025-04-13 19:38:34,179 INFO L128 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2025-04-13 19:38:34,189 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:38:34,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG workstealqueue_mutex-2.i that has 2 procedures, 163 locations, 233 edges, 1 initial locations, 11 loop locations, and 5 error locations. [2025-04-13 19:38:34,191 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:38:34,352 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 19:38:34,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 234 transitions, 475 flow [2025-04-13 19:38:34,511 INFO L116 PetriNetUnfolderBase]: 126/427 cut-off events. [2025-04-13 19:38:34,512 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:38:34,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 427 events. 126/427 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1681 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 218. Up to 13 conditions per place. [2025-04-13 19:38:34,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 234 transitions, 475 flow [2025-04-13 19:38:34,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 232 transitions, 471 flow [2025-04-13 19:38:34,532 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:38:34,544 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;@2f4ac98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:38:34,545 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:38:34,554 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:38:34,554 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-13 19:38:34,554 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:38:34,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:34,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:34,555 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:38:34,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:34,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1324009626, now seen corresponding path program 1 times [2025-04-13 19:38:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:34,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910858921] [2025-04-13 19:38:34,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:34,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:38:34,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:38:34,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:34,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:34,885 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 19:38:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:34,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910858921] [2025-04-13 19:38:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910858921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:34,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:38:34,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097522448] [2025-04-13 19:38:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:34,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:38:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:34,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:38:34,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:38:34,924 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 234 [2025-04-13 19:38:34,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 232 transitions, 471 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 19:38:34,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:34,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 234 [2025-04-13 19:38:34,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:36,315 INFO L116 PetriNetUnfolderBase]: 3358/5562 cut-off events. [2025-04-13 19:38:36,315 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:38:36,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11128 conditions, 5562 events. 3358/5562 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 26086 event pairs, 2040 based on Foata normal form. 0/4163 useless extension candidates. Maximal degree in co-relation 11094. Up to 5561 conditions per place. [2025-04-13 19:38:36,342 INFO L140 encePairwiseOnDemand]: 219/234 looper letters, 215 selfloop transitions, 0 changer transitions 1/217 dead transitions. [2025-04-13 19:38:36,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 217 transitions, 873 flow [2025-04-13 19:38:36,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:38:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:38:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2025-04-13 19:38:36,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49786324786324787 [2025-04-13 19:38:36,352 INFO L175 Difference]: Start difference. First operand has 166 places, 232 transitions, 471 flow. Second operand 2 states and 233 transitions. [2025-04-13 19:38:36,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 217 transitions, 873 flow [2025-04-13 19:38:36,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 217 transitions, 873 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:38:36,364 INFO L231 Difference]: Finished difference. Result has 167 places, 216 transitions, 439 flow [2025-04-13 19:38:36,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=439, PETRI_PLACES=167, PETRI_TRANSITIONS=216} [2025-04-13 19:38:36,368 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 1 predicate places. [2025-04-13 19:38:36,368 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 216 transitions, 439 flow [2025-04-13 19:38:36,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 19:38:36,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:36,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:36,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:38:36,369 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:38:36,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1063073301, now seen corresponding path program 1 times [2025-04-13 19:38:36,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:36,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410974098] [2025-04-13 19:38:36,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:36,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:36,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:38:36,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:38:36,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:36,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:36,563 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 19:38:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:36,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410974098] [2025-04-13 19:38:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410974098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:36,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:36,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:38:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53888483] [2025-04-13 19:38:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:36,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:38:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:36,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:38:36,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:38:36,566 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 234 [2025-04-13 19:38:36,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 216 transitions, 439 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 19:38:36,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:36,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 234 [2025-04-13 19:38:36,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:36,666 INFO L116 PetriNetUnfolderBase]: 24/79 cut-off events. [2025-04-13 19:38:36,666 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:38:36,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 79 events. 24/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 170 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 144. Up to 42 conditions per place. [2025-04-13 19:38:36,667 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 44 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-04-13 19:38:36,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 49 transitions, 198 flow [2025-04-13 19:38:36,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:38:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:38:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-13 19:38:36,668 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.0754985754985755 [2025-04-13 19:38:36,668 INFO L175 Difference]: Start difference. First operand has 167 places, 216 transitions, 439 flow. Second operand 3 states and 53 transitions. [2025-04-13 19:38:36,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 49 transitions, 198 flow [2025-04-13 19:38:36,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:38:36,671 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 78 flow [2025-04-13 19:38:36,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2025-04-13 19:38:36,672 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, -135 predicate places. [2025-04-13 19:38:36,672 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 78 flow [2025-04-13 19:38:36,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 19:38:36,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:36,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:36,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:38:36,673 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:38:36,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1411328745, now seen corresponding path program 1 times [2025-04-13 19:38:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:36,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401682298] [2025-04-13 19:38:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:36,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:38:36,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:38:36,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:36,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:36,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401682298] [2025-04-13 19:38:36,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401682298] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:38:36,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260119374] [2025-04-13 19:38:36,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:36,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:36,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:36,827 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 19:38:36,829 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 19:38:36,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:38:36,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:38:36,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:36,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:36,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:38:37,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:38:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:37,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:38:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260119374] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:38:37,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:38:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 19:38:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117987629] [2025-04-13 19:38:37,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:38:37,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:38:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:37,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:38:37,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:38:37,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 234 [2025-04-13 19:38:37,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 19:38:37,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:37,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 234 [2025-04-13 19:38:37,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:37,167 INFO L116 PetriNetUnfolderBase]: 24/82 cut-off events. [2025-04-13 19:38:37,168 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:38:37,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 82 events. 24/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 165 event pairs, 0 based on Foata normal form. 3/77 useless extension candidates. Maximal degree in co-relation 190. Up to 36 conditions per place. [2025-04-13 19:38:37,168 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 44 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2025-04-13 19:38:37,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 230 flow [2025-04-13 19:38:37,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:38:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:38:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-04-13 19:38:37,171 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.042735042735042736 [2025-04-13 19:38:37,171 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 78 flow. Second operand 6 states and 60 transitions. [2025-04-13 19:38:37,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 230 flow [2025-04-13 19:38:37,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:38:37,172 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 102 flow [2025-04-13 19:38:37,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-04-13 19:38:37,173 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, -131 predicate places. [2025-04-13 19:38:37,173 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 102 flow [2025-04-13 19:38:37,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 19:38:37,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:37,173 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:37,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:38:37,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:37,379 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:38:37,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash 315483797, now seen corresponding path program 2 times [2025-04-13 19:38:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:37,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796112284] [2025-04-13 19:38:37,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:37,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 19:38:37,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:38:37,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:38:37,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:38:37,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:38:37,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:38:37,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:38:37,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:37,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:38:37,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:38:37,497 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:38:37,500 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:38:37,502 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:38:37,502 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:38:37,502 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:38:37,502 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:38:37,502 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:38:37,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:38:37,502 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-13 19:38:37,504 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:38:37,504 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:38:37,599 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:38:37,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 256 transitions, 528 flow [2025-04-13 19:38:37,667 INFO L116 PetriNetUnfolderBase]: 194/656 cut-off events. [2025-04-13 19:38:37,667 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:38:37,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 656 events. 194/656 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3173 event pairs, 0 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 429. Up to 22 conditions per place. [2025-04-13 19:38:37,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 256 transitions, 528 flow [2025-04-13 19:38:37,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 255 transitions, 526 flow [2025-04-13 19:38:37,674 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:38:37,674 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;@2f4ac98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:38:37,674 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:38:37,677 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:38:37,677 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-13 19:38:37,677 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:38:37,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:37,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:37,677 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:38:37,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash -124884582, now seen corresponding path program 1 times [2025-04-13 19:38:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:37,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274819808] [2025-04-13 19:38:37,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:37,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:38:37,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:38:37,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:37,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:37,735 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 19:38:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:37,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274819808] [2025-04-13 19:38:37,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274819808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:37,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:37,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:38:37,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334907606] [2025-04-13 19:38:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:37,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:38:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:37,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:38:37,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:38:37,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:38:37,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 255 transitions, 526 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 19:38:37,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:37,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:38:37,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:51,773 INFO L116 PetriNetUnfolderBase]: 98922/136343 cut-off events. [2025-04-13 19:38:51,774 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-13 19:38:51,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272772 conditions, 136343 events. 98922/136343 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 784247 event pairs, 67695 based on Foata normal form. 0/103707 useless extension candidates. Maximal degree in co-relation 245720. Up to 136342 conditions per place. [2025-04-13 19:38:52,272 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 237 selfloop transitions, 0 changer transitions 1/239 dead transitions. [2025-04-13 19:38:52,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 239 transitions, 970 flow [2025-04-13 19:38:52,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:38:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:38:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2025-04-13 19:38:52,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:38:52,274 INFO L175 Difference]: Start difference. First operand has 184 places, 255 transitions, 526 flow. Second operand 2 states and 256 transitions. [2025-04-13 19:38:52,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 239 transitions, 970 flow [2025-04-13 19:38:52,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 239 transitions, 970 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:38:52,278 INFO L231 Difference]: Finished difference. Result has 185 places, 238 transitions, 492 flow [2025-04-13 19:38:52,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=492, PETRI_PLACES=185, PETRI_TRANSITIONS=238} [2025-04-13 19:38:52,279 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 1 predicate places. [2025-04-13 19:38:52,279 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 238 transitions, 492 flow [2025-04-13 19:38:52,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 19:38:52,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:52,279 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:52,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:38:52,279 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:38:52,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:52,280 INFO L85 PathProgramCache]: Analyzing trace with hash -613940767, now seen corresponding path program 1 times [2025-04-13 19:38:52,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:52,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421625262] [2025-04-13 19:38:52,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:52,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:52,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:38:52,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:38:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:52,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:52,346 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 19:38:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:52,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421625262] [2025-04-13 19:38:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421625262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:52,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:52,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:38:52,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716923794] [2025-04-13 19:38:52,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:52,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:38:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:52,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:38:52,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:38:52,348 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:38:52,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 238 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 19:38:52,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:52,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:38:52,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:17,062 INFO L116 PetriNetUnfolderBase]: 188182/257699 cut-off events. [2025-04-13 19:39:17,062 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-13 19:39:17,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515455 conditions, 257699 events. 188182/257699 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 1506273 event pairs, 64830 based on Foata normal form. 0/197127 useless extension candidates. Maximal degree in co-relation 515450. Up to 129670 conditions per place. [2025-04-13 19:39:18,091 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 443 selfloop transitions, 16 changer transitions 1/461 dead transitions. [2025-04-13 19:39:18,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 461 transitions, 1864 flow [2025-04-13 19:39:18,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:39:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:39:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-04-13 19:39:18,094 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6119791666666666 [2025-04-13 19:39:18,094 INFO L175 Difference]: Start difference. First operand has 185 places, 238 transitions, 492 flow. Second operand 3 states and 470 transitions. [2025-04-13 19:39:18,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 461 transitions, 1864 flow [2025-04-13 19:39:18,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 461 transitions, 1864 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:39:18,108 INFO L231 Difference]: Finished difference. Result has 187 places, 245 transitions, 568 flow [2025-04-13 19:39:18,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=187, PETRI_TRANSITIONS=245} [2025-04-13 19:39:18,109 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 3 predicate places. [2025-04-13 19:39:18,110 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 245 transitions, 568 flow [2025-04-13 19:39:18,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 19:39:18,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:18,110 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:18,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:39:18,110 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:39:18,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash -416987293, now seen corresponding path program 1 times [2025-04-13 19:39:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:18,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370185240] [2025-04-13 19:39:18,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:18,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:39:18,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:39:18,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:18,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:39:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:18,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370185240] [2025-04-13 19:39:18,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370185240] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:39:18,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331837040] [2025-04-13 19:39:18,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:18,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:39:18,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:18,234 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 19:39:18,235 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 19:39:18,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:39:18,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:39:18,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:18,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:18,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:39:18,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:39:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:39:18,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:39:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:39:18,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331837040] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:39:18,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:39:18,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 19:39:18,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244482212] [2025-04-13 19:39:18,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:39:18,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:39:18,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:18,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:39:18,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:39:18,460 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:39:18,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 245 transitions, 568 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 19:39:18,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:18,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:39:18,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:44,396 INFO L116 PetriNetUnfolderBase]: 188183/257691 cut-off events. [2025-04-13 19:39:44,396 INFO L117 PetriNetUnfolderBase]: For 2083/2083 co-relation queries the response was YES. [2025-04-13 19:39:44,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520176 conditions, 257691 events. 188183/257691 cut-off events. For 2083/2083 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 1506095 event pairs, 64830 based on Foata normal form. 3/198406 useless extension candidates. Maximal degree in co-relation 520169. Up to 129662 conditions per place. [2025-04-13 19:39:45,388 INFO L140 encePairwiseOnDemand]: 239/256 looper letters, 445 selfloop transitions, 23 changer transitions 0/469 dead transitions. [2025-04-13 19:39:45,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 469 transitions, 1970 flow [2025-04-13 19:39:45,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:39:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:39:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 477 transitions. [2025-04-13 19:39:45,390 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.310546875 [2025-04-13 19:39:45,390 INFO L175 Difference]: Start difference. First operand has 187 places, 245 transitions, 568 flow. Second operand 6 states and 477 transitions. [2025-04-13 19:39:45,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 469 transitions, 1970 flow [2025-04-13 19:39:45,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 469 transitions, 1954 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:39:45,399 INFO L231 Difference]: Finished difference. Result has 192 places, 252 transitions, 635 flow [2025-04-13 19:39:45,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=635, PETRI_PLACES=192, PETRI_TRANSITIONS=252} [2025-04-13 19:39:45,400 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 8 predicate places. [2025-04-13 19:39:45,400 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 252 transitions, 635 flow [2025-04-13 19:39:45,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 19:39:45,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:45,400 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:45,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:39:45,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-13 19:39:45,601 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:39:45,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:45,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2092019103, now seen corresponding path program 2 times [2025-04-13 19:39:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:45,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579165008] [2025-04-13 19:39:45,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:39:45,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:45,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:39:45,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-04-13 19:39:45,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:39:45,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:39:45,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:45,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579165008] [2025-04-13 19:39:45,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579165008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:39:45,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:39:45,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:39:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261269390] [2025-04-13 19:39:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:39:45,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:39:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:45,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:39:45,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:39:45,713 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:39:45,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 252 transitions, 635 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 19:39:45,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:45,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:39:45,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:12,204 INFO L116 PetriNetUnfolderBase]: 186551/255787 cut-off events. [2025-04-13 19:40:12,204 INFO L117 PetriNetUnfolderBase]: For 3154/3154 co-relation queries the response was YES. [2025-04-13 19:40:12,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516403 conditions, 255787 events. 186551/255787 cut-off events. For 3154/3154 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 1500430 event pairs, 64590 based on Foata normal form. 1280/197906 useless extension candidates. Maximal degree in co-relation 516396. Up to 127998 conditions per place. [2025-04-13 19:40:13,376 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 445 selfloop transitions, 16 changer transitions 0/461 dead transitions. [2025-04-13 19:40:13,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 461 transitions, 1971 flow [2025-04-13 19:40:13,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 463 transitions. [2025-04-13 19:40:13,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4521484375 [2025-04-13 19:40:13,378 INFO L175 Difference]: Start difference. First operand has 192 places, 252 transitions, 635 flow. Second operand 4 states and 463 transitions. [2025-04-13 19:40:13,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 461 transitions, 1971 flow [2025-04-13 19:40:13,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 461 transitions, 1917 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-13 19:40:13,391 INFO L231 Difference]: Finished difference. Result has 190 places, 246 transitions, 591 flow [2025-04-13 19:40:13,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=591, PETRI_PLACES=190, PETRI_TRANSITIONS=246} [2025-04-13 19:40:13,391 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 6 predicate places. [2025-04-13 19:40:13,392 INFO L485 AbstractCegarLoop]: Abstraction has has 190 places, 246 transitions, 591 flow [2025-04-13 19:40:13,392 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 19:40:13,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:13,392 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:13,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:40:13,392 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:13,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1674132126, now seen corresponding path program 1 times [2025-04-13 19:40:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:13,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829638334] [2025-04-13 19:40:13,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:13,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:40:13,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:40:13,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:13,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:40:16,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:16,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829638334] [2025-04-13 19:40:16,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829638334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:16,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:40:16,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533960673] [2025-04-13 19:40:16,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:16,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:40:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:16,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:40:16,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:40:16,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:40:16,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 246 transitions, 591 flow. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:16,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:16,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:40:16,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:45,281 INFO L116 PetriNetUnfolderBase]: 186632/255919 cut-off events. [2025-04-13 19:40:45,282 INFO L117 PetriNetUnfolderBase]: For 2981/2981 co-relation queries the response was YES. [2025-04-13 19:40:45,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516667 conditions, 255919 events. 186632/255919 cut-off events. For 2981/2981 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 1502999 event pairs, 102094 based on Foata normal form. 0/196775 useless extension candidates. Maximal degree in co-relation 516661. Up to 255710 conditions per place. [2025-04-13 19:40:46,453 INFO L140 encePairwiseOnDemand]: 242/256 looper letters, 274 selfloop transitions, 19 changer transitions 0/293 dead transitions. [2025-04-13 19:40:46,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 293 transitions, 1282 flow [2025-04-13 19:40:46,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:40:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:40:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 297 transitions. [2025-04-13 19:40:46,455 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.116015625 [2025-04-13 19:40:46,455 INFO L175 Difference]: Start difference. First operand has 190 places, 246 transitions, 591 flow. Second operand 10 states and 297 transitions. [2025-04-13 19:40:46,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 293 transitions, 1282 flow [2025-04-13 19:40:46,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 293 transitions, 1263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:46,465 INFO L231 Difference]: Finished difference. Result has 202 places, 261 transitions, 685 flow [2025-04-13 19:40:46,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=685, PETRI_PLACES=202, PETRI_TRANSITIONS=261} [2025-04-13 19:40:46,467 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 18 predicate places. [2025-04-13 19:40:46,468 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 261 transitions, 685 flow [2025-04-13 19:40:46,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:46,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:46,468 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:46,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:40:46,468 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:46,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:46,469 INFO L85 PathProgramCache]: Analyzing trace with hash -90794904, now seen corresponding path program 1 times [2025-04-13 19:40:46,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:46,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739406600] [2025-04-13 19:40:46,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:46,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 19:40:46,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 19:40:46,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:46,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:40:46,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:46,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739406600] [2025-04-13 19:40:46,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739406600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:46,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:46,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:40:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428672830] [2025-04-13 19:40:46,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:46,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:40:46,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:46,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:40:46,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:40:46,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:40:46,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 261 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:46,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:46,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:40:46,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:52,382 INFO L116 PetriNetUnfolderBase]: 27452/40559 cut-off events. [2025-04-13 19:40:52,382 INFO L117 PetriNetUnfolderBase]: For 3355/3355 co-relation queries the response was YES. [2025-04-13 19:40:52,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85344 conditions, 40559 events. 27452/40559 cut-off events. For 3355/3355 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 221279 event pairs, 4505 based on Foata normal form. 4388/34619 useless extension candidates. Maximal degree in co-relation 85333. Up to 35783 conditions per place. [2025-04-13 19:40:52,542 INFO L140 encePairwiseOnDemand]: 244/256 looper letters, 322 selfloop transitions, 12 changer transitions 0/334 dead transitions. [2025-04-13 19:40:52,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 334 transitions, 1577 flow [2025-04-13 19:40:52,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2025-04-13 19:40:52,543 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4088541666666667 [2025-04-13 19:40:52,543 INFO L175 Difference]: Start difference. First operand has 202 places, 261 transitions, 685 flow. Second operand 3 states and 314 transitions. [2025-04-13 19:40:52,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 334 transitions, 1577 flow [2025-04-13 19:40:52,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 334 transitions, 1571 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:52,551 INFO L231 Difference]: Finished difference. Result has 201 places, 261 transitions, 703 flow [2025-04-13 19:40:52,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=201, PETRI_TRANSITIONS=261} [2025-04-13 19:40:52,552 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 17 predicate places. [2025-04-13 19:40:52,552 INFO L485 AbstractCegarLoop]: Abstraction has has 201 places, 261 transitions, 703 flow [2025-04-13 19:40:52,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:52,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:52,552 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:52,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:40:52,552 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:40:52,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash 346281077, now seen corresponding path program 1 times [2025-04-13 19:40:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:52,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807697132] [2025-04-13 19:40:52,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:52,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:40:52,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:40:52,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:52,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:40:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:55,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807697132] [2025-04-13 19:40:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807697132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:55,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:55,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-13 19:40:55,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238082601] [2025-04-13 19:40:55,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:55,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 19:40:55,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:55,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 19:40:55,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-13 19:40:55,657 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:40:55,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 261 transitions, 703 flow. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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 19:40:55,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:55,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:40:55,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:41:05,761 INFO L116 PetriNetUnfolderBase]: 34603/50634 cut-off events. [2025-04-13 19:41:05,762 INFO L117 PetriNetUnfolderBase]: For 5356/5356 co-relation queries the response was YES. [2025-04-13 19:41:05,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109751 conditions, 50634 events. 34603/50634 cut-off events. For 5356/5356 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 266967 event pairs, 8592 based on Foata normal form. 0/37235 useless extension candidates. Maximal degree in co-relation 109739. Up to 34787 conditions per place. [2025-04-13 19:41:06,025 INFO L140 encePairwiseOnDemand]: 157/256 looper letters, 438 selfloop transitions, 160 changer transitions 0/598 dead transitions. [2025-04-13 19:41:06,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 598 transitions, 2793 flow [2025-04-13 19:41:06,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 19:41:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 19:41:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 600 transitions. [2025-04-13 19:41:06,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.09014423076923077 [2025-04-13 19:41:06,028 INFO L175 Difference]: Start difference. First operand has 201 places, 261 transitions, 703 flow. Second operand 26 states and 600 transitions. [2025-04-13 19:41:06,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 598 transitions, 2793 flow [2025-04-13 19:41:06,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 598 transitions, 2747 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:41:06,050 INFO L231 Difference]: Finished difference. Result has 234 places, 343 transitions, 1487 flow [2025-04-13 19:41:06,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1487, PETRI_PLACES=234, PETRI_TRANSITIONS=343} [2025-04-13 19:41:06,051 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 50 predicate places. [2025-04-13 19:41:06,051 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 343 transitions, 1487 flow [2025-04-13 19:41:06,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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 19:41:06,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:41:06,052 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:41:06,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:41:06,052 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:41:06,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:41:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 289022775, now seen corresponding path program 1 times [2025-04-13 19:41:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:41:06,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879048592] [2025-04-13 19:41:06,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:41:06,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:41:06,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:41:06,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:41:06,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:41:06,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:41:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:41:10,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:41:10,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879048592] [2025-04-13 19:41:10,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879048592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:41:10,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:41:10,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 19:41:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918327073] [2025-04-13 19:41:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:41:10,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 19:41:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:41:10,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 19:41:10,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-04-13 19:41:10,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:41:10,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 343 transitions, 1487 flow. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 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 19:41:10,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:41:10,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:41:10,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:41:23,906 INFO L116 PetriNetUnfolderBase]: 35408/51793 cut-off events. [2025-04-13 19:41:23,906 INFO L117 PetriNetUnfolderBase]: For 17327/17327 co-relation queries the response was YES. [2025-04-13 19:41:24,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133383 conditions, 51793 events. 35408/51793 cut-off events. For 17327/17327 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 275216 event pairs, 11765 based on Foata normal form. 0/38844 useless extension candidates. Maximal degree in co-relation 133361. Up to 49944 conditions per place. [2025-04-13 19:41:24,181 INFO L140 encePairwiseOnDemand]: 208/256 looper letters, 439 selfloop transitions, 89 changer transitions 0/528 dead transitions. [2025-04-13 19:41:24,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 528 transitions, 3149 flow [2025-04-13 19:41:24,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 19:41:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 19:41:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 452 transitions. [2025-04-13 19:41:24,184 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.07356770833333333 [2025-04-13 19:41:24,184 INFO L175 Difference]: Start difference. First operand has 234 places, 343 transitions, 1487 flow. Second operand 24 states and 452 transitions. [2025-04-13 19:41:24,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 528 transitions, 3149 flow [2025-04-13 19:41:24,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 528 transitions, 2997 flow, removed 56 selfloop flow, removed 7 redundant places. [2025-04-13 19:41:24,344 INFO L231 Difference]: Finished difference. Result has 262 places, 405 transitions, 2010 flow [2025-04-13 19:41:24,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2010, PETRI_PLACES=262, PETRI_TRANSITIONS=405} [2025-04-13 19:41:24,345 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 78 predicate places. [2025-04-13 19:41:24,345 INFO L485 AbstractCegarLoop]: Abstraction has has 262 places, 405 transitions, 2010 flow [2025-04-13 19:41:24,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 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 19:41:24,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:41:24,345 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:41:24,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:41:24,345 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:41:24,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:41:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash -335996649, now seen corresponding path program 1 times [2025-04-13 19:41:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:41:24,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863356043] [2025-04-13 19:41:24,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:41:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:41:24,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 19:41:24,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:41:24,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:41:24,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:41:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:41:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:41:26,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863356043] [2025-04-13 19:41:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863356043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:41:26,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:41:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 19:41:26,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852510463] [2025-04-13 19:41:26,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:41:26,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:41:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:41:26,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:41:26,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:41:26,335 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:41:26,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 405 transitions, 2010 flow. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:41:26,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:41:26,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:41:26,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:41:43,687 INFO L116 PetriNetUnfolderBase]: 50004/71912 cut-off events. [2025-04-13 19:41:43,687 INFO L117 PetriNetUnfolderBase]: For 26440/26440 co-relation queries the response was YES. [2025-04-13 19:41:44,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183507 conditions, 71912 events. 50004/71912 cut-off events. For 26440/26440 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 391259 event pairs, 8541 based on Foata normal form. 0/53381 useless extension candidates. Maximal degree in co-relation 183473. Up to 51747 conditions per place. [2025-04-13 19:41:44,378 INFO L140 encePairwiseOnDemand]: 214/256 looper letters, 885 selfloop transitions, 139 changer transitions 0/1024 dead transitions. [2025-04-13 19:41:44,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1024 transitions, 6779 flow [2025-04-13 19:41:44,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 19:41:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 19:41:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 742 transitions. [2025-04-13 19:41:44,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.1317471590909091 [2025-04-13 19:41:44,381 INFO L175 Difference]: Start difference. First operand has 262 places, 405 transitions, 2010 flow. Second operand 22 states and 742 transitions. [2025-04-13 19:41:44,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1024 transitions, 6779 flow [2025-04-13 19:41:44,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 1024 transitions, 6719 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-13 19:41:44,503 INFO L231 Difference]: Finished difference. Result has 286 places, 476 transitions, 2813 flow [2025-04-13 19:41:44,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2813, PETRI_PLACES=286, PETRI_TRANSITIONS=476} [2025-04-13 19:41:44,504 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 102 predicate places. [2025-04-13 19:41:44,504 INFO L485 AbstractCegarLoop]: Abstraction has has 286 places, 476 transitions, 2813 flow [2025-04-13 19:41:44,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:41:44,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:41:44,504 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:41:44,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:41:44,504 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:41:44,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:41:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash -613006979, now seen corresponding path program 1 times [2025-04-13 19:41:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:41:44,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603771176] [2025-04-13 19:41:44,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:41:44,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:41:44,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 19:41:44,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:41:44,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:41:44,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:41:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:41:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:41:46,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603771176] [2025-04-13 19:41:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603771176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:41:46,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:41:46,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 19:41:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634210535] [2025-04-13 19:41:46,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:41:46,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 19:41:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:41:46,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 19:41:46,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 19:41:46,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:41:46,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 476 transitions, 2813 flow. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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 19:41:46,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:41:46,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:41:46,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:42:05,973 INFO L116 PetriNetUnfolderBase]: 53047/76571 cut-off events. [2025-04-13 19:42:05,974 INFO L117 PetriNetUnfolderBase]: For 110747/110747 co-relation queries the response was YES. [2025-04-13 19:42:06,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253198 conditions, 76571 events. 53047/76571 cut-off events. For 110747/110747 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 419965 event pairs, 15528 based on Foata normal form. 274/58023 useless extension candidates. Maximal degree in co-relation 253152. Up to 69622 conditions per place. [2025-04-13 19:42:06,896 INFO L140 encePairwiseOnDemand]: 210/256 looper letters, 569 selfloop transitions, 171 changer transitions 0/740 dead transitions. [2025-04-13 19:42:06,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 740 transitions, 5620 flow [2025-04-13 19:42:06,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 19:42:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 19:42:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 507 transitions. [2025-04-13 19:42:06,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.08610733695652174 [2025-04-13 19:42:06,900 INFO L175 Difference]: Start difference. First operand has 286 places, 476 transitions, 2813 flow. Second operand 23 states and 507 transitions. [2025-04-13 19:42:06,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 740 transitions, 5620 flow [2025-04-13 19:42:07,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 740 transitions, 5612 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 19:42:07,783 INFO L231 Difference]: Finished difference. Result has 316 places, 552 transitions, 3855 flow [2025-04-13 19:42:07,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=2805, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3855, PETRI_PLACES=316, PETRI_TRANSITIONS=552} [2025-04-13 19:42:07,784 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 132 predicate places. [2025-04-13 19:42:07,784 INFO L485 AbstractCegarLoop]: Abstraction has has 316 places, 552 transitions, 3855 flow [2025-04-13 19:42:07,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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 19:42:07,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:42:07,784 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:42:07,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:42:07,784 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:42:07,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:42:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1932222279, now seen corresponding path program 2 times [2025-04-13 19:42:07,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:42:07,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978640122] [2025-04-13 19:42:07,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:42:07,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:42:07,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 19:42:07,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:42:07,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:42:07,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:42:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:42:09,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:42:09,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978640122] [2025-04-13 19:42:09,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978640122] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:42:09,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71664003] [2025-04-13 19:42:09,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:42:09,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:42:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:42:09,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:42:09,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:42:09,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 19:42:36,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:42:36,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:42:36,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:42:36,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 203 conjuncts are in the unsatisfiable core [2025-04-13 19:42:36,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:42:36,625 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 11 treesize of output 7 [2025-04-13 19:42:36,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:42:36,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2025-04-13 19:42:36,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-13 19:42:36,831 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 19:42:36,835 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 19:42:36,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-13 19:42:36,982 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 19:42:36,985 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 19:42:37,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:42:37,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 19:42:37,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:42:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:42:37,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:42:37,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-13 19:42:37,815 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:42:37,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 165 [2025-04-13 19:42:37,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2025-04-13 19:42:37,839 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:42:37,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 97 [2025-04-13 19:42:38,272 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:42:38,273 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 72 treesize of output 93 [2025-04-13 19:42:38,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2025-04-13 19:42:38,380 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 34 treesize of output 28 [2025-04-13 19:42:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:42:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71664003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:42:38,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:42:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2025-04-13 19:42:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833286883] [2025-04-13 19:42:38,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:42:38,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 19:42:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:42:38,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 19:42:38,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1182, Unknown=3, NotChecked=0, Total=1332 [2025-04-13 19:42:38,390 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:42:38,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 552 transitions, 3855 flow. Second operand has 37 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 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 19:42:38,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:42:38,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:42:38,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:43:05,988 INFO L116 PetriNetUnfolderBase]: 58762/85310 cut-off events. [2025-04-13 19:43:05,988 INFO L117 PetriNetUnfolderBase]: For 147669/147669 co-relation queries the response was YES. [2025-04-13 19:43:06,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302757 conditions, 85310 events. 58762/85310 cut-off events. For 147669/147669 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 479842 event pairs, 15581 based on Foata normal form. 294/65373 useless extension candidates. Maximal degree in co-relation 302701. Up to 73351 conditions per place. [2025-04-13 19:43:07,058 INFO L140 encePairwiseOnDemand]: 204/256 looper letters, 723 selfloop transitions, 256 changer transitions 0/979 dead transitions. [2025-04-13 19:43:07,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 979 transitions, 8250 flow [2025-04-13 19:43:07,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 19:43:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 19:43:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 687 transitions. [2025-04-13 19:43:07,061 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.08132102272727272 [2025-04-13 19:43:07,061 INFO L175 Difference]: Start difference. First operand has 316 places, 552 transitions, 3855 flow. Second operand 33 states and 687 transitions. [2025-04-13 19:43:07,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 979 transitions, 8250 flow [2025-04-13 19:43:08,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 979 transitions, 8091 flow, removed 39 selfloop flow, removed 7 redundant places. [2025-04-13 19:43:08,964 INFO L231 Difference]: Finished difference. Result has 351 places, 671 transitions, 5485 flow [2025-04-13 19:43:08,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=3722, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5485, PETRI_PLACES=351, PETRI_TRANSITIONS=671} [2025-04-13 19:43:08,965 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 167 predicate places. [2025-04-13 19:43:08,965 INFO L485 AbstractCegarLoop]: Abstraction has has 351 places, 671 transitions, 5485 flow [2025-04-13 19:43:08,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 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 19:43:08,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:08,966 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:43:08,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:43:09,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:09,167 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:43:09,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash -871097347, now seen corresponding path program 3 times [2025-04-13 19:43:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:09,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274682347] [2025-04-13 19:43:09,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:43:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:09,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 19:43:09,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 19:43:09,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:43:09,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:43:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:12,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274682347] [2025-04-13 19:43:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274682347] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:43:12,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016145403] [2025-04-13 19:43:12,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:43:12,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:12,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:43:12,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:43:12,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:43:12,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 19:43:44,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 19:43:44,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:43:44,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:44,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 236 conjuncts are in the unsatisfiable core [2025-04-13 19:43:44,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:43:44,718 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 11 treesize of output 7 [2025-04-13 19:43:44,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:43:44,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2025-04-13 19:43:44,899 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 19:43:44,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-13 19:43:44,909 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 19:43:45,112 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:43:45,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2025-04-13 19:43:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:43:45,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:43:45,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-13 19:43:46,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:43:46,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 342 treesize of output 545 [2025-04-13 19:43:46,604 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:43:46,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 310 [2025-04-13 19:43:46,631 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:43:46,632 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 301 treesize of output 304 [2025-04-13 19:43:46,656 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:43:46,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 300 [2025-04-13 19:43:46,671 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 289 [2025-04-13 19:43:49,394 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:43:49,394 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 72 treesize of output 93 [2025-04-13 19:43:49,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2025-04-13 19:43:49,491 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 34 treesize of output 28 [2025-04-13 19:43:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:43:49,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016145403] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:43:49,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:43:49,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 39 [2025-04-13 19:43:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251010456] [2025-04-13 19:43:49,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:43:49,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 19:43:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:49,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 19:43:49,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1387, Unknown=12, NotChecked=0, Total=1560 [2025-04-13 19:43:49,497 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:43:49,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 671 transitions, 5485 flow. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 19:43:49,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:49,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:43:49,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:44:27,259 INFO L116 PetriNetUnfolderBase]: 61834/90050 cut-off events. [2025-04-13 19:44:27,259 INFO L117 PetriNetUnfolderBase]: For 267357/267357 co-relation queries the response was YES. [2025-04-13 19:44:28,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364457 conditions, 90050 events. 61834/90050 cut-off events. For 267357/267357 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 514678 event pairs, 17065 based on Foata normal form. 708/70469 useless extension candidates. Maximal degree in co-relation 364391. Up to 82487 conditions per place. [2025-04-13 19:44:29,000 INFO L140 encePairwiseOnDemand]: 207/256 looper letters, 804 selfloop transitions, 233 changer transitions 0/1037 dead transitions. [2025-04-13 19:44:29,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 1037 transitions, 9780 flow [2025-04-13 19:44:29,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 19:44:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-13 19:44:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 652 transitions. [2025-04-13 19:44:29,003 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.07276785714285715 [2025-04-13 19:44:29,003 INFO L175 Difference]: Start difference. First operand has 351 places, 671 transitions, 5485 flow. Second operand 35 states and 652 transitions. [2025-04-13 19:44:29,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 1037 transitions, 9780 flow [2025-04-13 19:44:33,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 1037 transitions, 9325 flow, removed 147 selfloop flow, removed 13 redundant places. [2025-04-13 19:44:33,053 INFO L231 Difference]: Finished difference. Result has 380 places, 765 transitions, 6394 flow [2025-04-13 19:44:33,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=5092, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=6394, PETRI_PLACES=380, PETRI_TRANSITIONS=765} [2025-04-13 19:44:33,054 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 196 predicate places. [2025-04-13 19:44:33,054 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 765 transitions, 6394 flow [2025-04-13 19:44:33,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 19:44:33,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:44:33,055 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:44:33,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:44:33,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 19:44:33,255 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:44:33,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:44:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1046510043, now seen corresponding path program 4 times [2025-04-13 19:44:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:44:33,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309303211] [2025-04-13 19:44:33,256 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:44:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:44:33,286 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 19:44:33,315 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:44:33,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:44:33,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:44:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:44:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:44:35,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309303211] [2025-04-13 19:44:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309303211] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:44:35,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103106200] [2025-04-13 19:44:35,117 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:44:35,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:44:35,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:44:35,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:44:35,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:44:35,347 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 19:44:35,962 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:44:35,962 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:44:35,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:44:35,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 226 conjuncts are in the unsatisfiable core [2025-04-13 19:44:35,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:44:36,001 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 11 treesize of output 7 [2025-04-13 19:44:36,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:44:36,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2025-04-13 19:44:36,181 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 19:44:36,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 6 [2025-04-13 19:44:36,186 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 19:44:36,194 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-13 19:44:36,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-13 19:44:36,342 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 19:44:36,345 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 19:44:36,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-13 19:44:36,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:44:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:44:36,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:44:36,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-13 19:44:37,305 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:44:37,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 391 treesize of output 594 [2025-04-13 19:44:41,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-13 19:44:41,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-04-13 19:44:41,164 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:44:41,164 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 76 treesize of output 79 [2025-04-13 19:44:41,306 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 38 treesize of output 32 [2025-04-13 19:44:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:44:41,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103106200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:44:41,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:44:41,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 41 [2025-04-13 19:44:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941242281] [2025-04-13 19:44:41,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:44:41,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 19:44:41,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:44:41,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 19:44:41,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1505, Unknown=1, NotChecked=0, Total=1722 [2025-04-13 19:44:41,340 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:44:41,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 765 transitions, 6394 flow. Second operand has 42 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 42 states have internal predecessors, (127), 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 19:44:41,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:44:41,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:44:41,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:19,552 INFO L116 PetriNetUnfolderBase]: 66530/97298 cut-off events. [2025-04-13 19:45:19,552 INFO L117 PetriNetUnfolderBase]: For 334063/334063 co-relation queries the response was YES. [2025-04-13 19:45:21,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406606 conditions, 97298 events. 66530/97298 cut-off events. For 334063/334063 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 566816 event pairs, 16568 based on Foata normal form. 1220/77167 useless extension candidates. Maximal degree in co-relation 406534. Up to 81710 conditions per place. [2025-04-13 19:45:21,417 INFO L140 encePairwiseOnDemand]: 206/256 looper letters, 953 selfloop transitions, 350 changer transitions 0/1303 dead transitions. [2025-04-13 19:45:21,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 1303 transitions, 12417 flow [2025-04-13 19:45:21,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 19:45:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-13 19:45:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 851 transitions. [2025-04-13 19:45:21,420 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.06518075980392157 [2025-04-13 19:45:21,420 INFO L175 Difference]: Start difference. First operand has 380 places, 765 transitions, 6394 flow. Second operand 51 states and 851 transitions. [2025-04-13 19:45:21,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 1303 transitions, 12417 flow [2025-04-13 19:45:24,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 1303 transitions, 12071 flow, removed 93 selfloop flow, removed 12 redundant places. [2025-04-13 19:45:24,953 INFO L231 Difference]: Finished difference. Result has 433 places, 872 transitions, 8204 flow [2025-04-13 19:45:24,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=6074, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=8204, PETRI_PLACES=433, PETRI_TRANSITIONS=872} [2025-04-13 19:45:24,954 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 249 predicate places. [2025-04-13 19:45:24,954 INFO L485 AbstractCegarLoop]: Abstraction has has 433 places, 872 transitions, 8204 flow [2025-04-13 19:45:24,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 42 states have internal predecessors, (127), 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 19:45:24,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:24,954 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:24,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 19:45:25,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 19:45:25,155 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:45:25,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1984976927, now seen corresponding path program 5 times [2025-04-13 19:45:25,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:25,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823531592] [2025-04-13 19:45:25,156 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:45:25,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:25,187 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 19:45:25,202 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:45:25,202 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 19:45:25,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:45:27,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:27,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823531592] [2025-04-13 19:45:27,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823531592] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:45:27,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903215879] [2025-04-13 19:45:27,040 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:45:27,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:45:27,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:27,044 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:45:27,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:45:27,286 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 19:45:27,372 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:45:27,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 19:45:27,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:27,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 179 conjuncts are in the unsatisfiable core [2025-04-13 19:45:27,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:45:27,413 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 11 treesize of output 7 [2025-04-13 19:45:27,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:45:27,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2025-04-13 19:45:27,565 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 19:45:27,567 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 19:45:27,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:45:27,766 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:45:27,772 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 19:45:27,782 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 19:45:27,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 19:45:27,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-04-13 19:45:27,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 19:45:27,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:45:28,149 INFO L325 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-04-13 19:45:28,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2025-04-13 19:45:28,158 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 19 treesize of output 11 [2025-04-13 19:45:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:45:28,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:45:33,057 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:45:33,057 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 196 treesize of output 217 [2025-04-13 19:45:34,078 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:45:34,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 423 treesize of output 783 [2025-04-13 19:45:34,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 382 treesize of output 380 [2025-04-13 19:45:34,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 378 [2025-04-13 19:45:34,166 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 376 [2025-04-13 19:45:34,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 374 [2025-04-13 19:45:36,420 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 38 treesize of output 32 [2025-04-13 19:45:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:45:36,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903215879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:45:36,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:45:36,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 42 [2025-04-13 19:45:36,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467197609] [2025-04-13 19:45:36,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:45:36,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 19:45:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:36,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 19:45:36,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1619, Unknown=1, NotChecked=0, Total=1806 [2025-04-13 19:45:36,483 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:45:36,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 872 transitions, 8204 flow. Second operand has 43 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 43 states have internal predecessors, (128), 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 19:45:36,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:36,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:45:36,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:46:04,370 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 19:46:08,386 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 19:46:30,695 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 19:46:35,461 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 19:46:39,482 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 19:46:43,587 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 19:46:52,534 INFO L116 PetriNetUnfolderBase]: 77457/114223 cut-off events. [2025-04-13 19:46:52,534 INFO L117 PetriNetUnfolderBase]: For 533011/533011 co-relation queries the response was YES. [2025-04-13 19:46:54,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516102 conditions, 114223 events. 77457/114223 cut-off events. For 533011/533011 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 692987 event pairs, 16229 based on Foata normal form. 1526/91983 useless extension candidates. Maximal degree in co-relation 516014. Up to 92674 conditions per place. [2025-04-13 19:46:55,130 INFO L140 encePairwiseOnDemand]: 206/256 looper letters, 1146 selfloop transitions, 541 changer transitions 0/1687 dead transitions. [2025-04-13 19:46:55,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 1687 transitions, 18366 flow [2025-04-13 19:46:55,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 19:46:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-04-13 19:46:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 952 transitions. [2025-04-13 19:46:55,133 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.05997983870967742 [2025-04-13 19:46:55,133 INFO L175 Difference]: Start difference. First operand has 433 places, 872 transitions, 8204 flow. Second operand 62 states and 952 transitions. [2025-04-13 19:46:55,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 1687 transitions, 18366 flow [2025-04-13 19:47:01,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 1687 transitions, 17784 flow, removed 153 selfloop flow, removed 24 redundant places. [2025-04-13 19:47:01,228 INFO L231 Difference]: Finished difference. Result has 498 places, 1261 transitions, 14388 flow [2025-04-13 19:47:01,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=7690, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=14388, PETRI_PLACES=498, PETRI_TRANSITIONS=1261} [2025-04-13 19:47:01,229 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 314 predicate places. [2025-04-13 19:47:01,229 INFO L485 AbstractCegarLoop]: Abstraction has has 498 places, 1261 transitions, 14388 flow [2025-04-13 19:47:01,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 43 states have internal predecessors, (128), 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 19:47:01,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:47:01,229 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:47:01,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:47:01,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 19:47:01,430 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:47:01,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:47:01,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1984945255, now seen corresponding path program 6 times [2025-04-13 19:47:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:47:01,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943228455] [2025-04-13 19:47:01,431 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:47:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:47:01,460 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 19:47:01,557 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:47:01,557 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:47:01,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:47:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:47:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:47:03,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943228455] [2025-04-13 19:47:03,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943228455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:47:03,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784245772] [2025-04-13 19:47:03,103 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:47:03,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:47:03,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:47:03,104 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:47:03,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:47:03,388 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 19:47:27,672 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:47:27,673 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:47:27,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:47:27,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 175 conjuncts are in the unsatisfiable core [2025-04-13 19:47:27,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:47:27,716 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 11 treesize of output 7 [2025-04-13 19:47:27,745 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:47:27,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2025-04-13 19:47:28,004 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:47:28,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:47:28,294 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 19:47:28,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 19:47:28,311 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 19:47:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:47:28,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:47:28,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-13 19:47:28,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-13 19:47:30,848 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:47:30,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 434 treesize of output 637 [2025-04-13 19:47:30,907 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:47:30,907 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 401 treesize of output 406 [2025-04-13 19:47:30,920 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 395 [2025-04-13 19:47:30,933 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 395 treesize of output 393 [2025-04-13 19:47:30,969 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:47:30,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 398 [2025-04-13 19:47:35,281 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 34 treesize of output 28 [2025-04-13 19:47:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:47:35,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784245772] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:47:35,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:47:35,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-04-13 19:47:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822566359] [2025-04-13 19:47:35,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:47:35,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 19:47:35,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:47:35,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 19:47:35,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1047, Unknown=16, NotChecked=0, Total=1190 [2025-04-13 19:47:35,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:47:35,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 1261 transitions, 14388 flow. Second operand has 35 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 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 19:47:35,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:47:35,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:47:35,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:48:42,335 INFO L116 PetriNetUnfolderBase]: 84102/124600 cut-off events. [2025-04-13 19:48:42,335 INFO L117 PetriNetUnfolderBase]: For 721992/721992 co-relation queries the response was YES. [2025-04-13 19:48:45,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614630 conditions, 124600 events. 84102/124600 cut-off events. For 721992/721992 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 771734 event pairs, 17891 based on Foata normal form. 826/100360 useless extension candidates. Maximal degree in co-relation 614516. Up to 111643 conditions per place. [2025-04-13 19:48:45,519 INFO L140 encePairwiseOnDemand]: 211/256 looper letters, 1469 selfloop transitions, 339 changer transitions 0/1808 dead transitions. [2025-04-13 19:48:45,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 1808 transitions, 23046 flow [2025-04-13 19:48:45,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 19:48:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 19:48:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 713 transitions. [2025-04-13 19:48:45,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.07141426282051282 [2025-04-13 19:48:45,521 INFO L175 Difference]: Start difference. First operand has 498 places, 1261 transitions, 14388 flow. Second operand 39 states and 713 transitions. [2025-04-13 19:48:45,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 1808 transitions, 23046 flow [2025-04-13 19:48:56,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 1808 transitions, 20572 flow, removed 1169 selfloop flow, removed 12 redundant places. [2025-04-13 19:48:57,007 INFO L231 Difference]: Finished difference. Result has 541 places, 1400 transitions, 15555 flow [2025-04-13 19:48:57,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=12678, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=15555, PETRI_PLACES=541, PETRI_TRANSITIONS=1400} [2025-04-13 19:48:57,008 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 357 predicate places. [2025-04-13 19:48:57,009 INFO L485 AbstractCegarLoop]: Abstraction has has 541 places, 1400 transitions, 15555 flow [2025-04-13 19:48:57,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 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 19:48:57,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:48:57,009 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:48:57,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:48:57,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:57,209 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:48:57,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:48:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash -228108675, now seen corresponding path program 7 times [2025-04-13 19:48:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:48:57,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158428518] [2025-04-13 19:48:57,210 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:48:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:48:57,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 19:48:57,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:48:57,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:48:57,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:48:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:48:58,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158428518] [2025-04-13 19:48:58,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158428518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:48:58,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094021650] [2025-04-13 19:48:58,711 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:48:58,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:48:58,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:48:58,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:48:58,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:48:58,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 19:48:59,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 19:48:59,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:48:59,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:48:59,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 163 conjuncts are in the unsatisfiable core [2025-04-13 19:48:59,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:48:59,076 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 11 treesize of output 7 [2025-04-13 19:48:59,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:48:59,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2025-04-13 19:48:59,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:48:59,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 19:48:59,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-04-13 19:48:59,530 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 19:48:59,534 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 19:48:59,538 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 19:48:59,694 INFO L325 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-04-13 19:48:59,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2025-04-13 19:48:59,699 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 51 treesize of output 35 [2025-04-13 19:48:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:48:59,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:48:59,919 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 12 treesize of output 8 [2025-04-13 19:48:59,923 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 11 treesize of output 7 [2025-04-13 19:49:00,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:49:00,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 260 [2025-04-13 19:49:00,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:49:00,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 194 [2025-04-13 19:49:00,570 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:49:00,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 190 [2025-04-13 19:49:01,190 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 34 treesize of output 28 [2025-04-13 19:49:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 19:49:01,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094021650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:49:01,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:49:01,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-04-13 19:49:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782189169] [2025-04-13 19:49:01,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:49:01,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 19:49:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:49:01,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 19:49:01,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1122, Unknown=7, NotChecked=0, Total=1260 [2025-04-13 19:49:01,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 256 [2025-04-13 19:49:01,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 1400 transitions, 15555 flow. Second operand has 36 states, 36 states have (on average 3.3055555555555554) internal successors, (119), 36 states have internal predecessors, (119), 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 19:49:01,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:49:01,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 256 [2025-04-13 19:49:01,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:49:09,783 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 19:49:15,177 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 [0, 1] [2025-04-13 19:50:06,687 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] Received shutdown request... [2025-04-13 19:50:19,364 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:50:19,364 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:50:20,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 19:50:20,501 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 0 [2025-04-13 19:50:22,943 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 19:50:22,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 19:50:22,944 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 19:50:22,944 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:50:22,944 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:50:22,944 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:50:22,944 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:50:22,944 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-04-13 19:50:22,944 INFO L422 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:50:22,946 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-13 19:50:22,946 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:50:22,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:50:22 BasicIcfg [2025-04-13 19:50:22,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:50:22,949 INFO L158 Benchmark]: Toolchain (without parser) took 713082.31ms. Allocated memory was 155.2MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 105.1MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. [2025-04-13 19:50:22,949 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:50:22,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 828.68ms. Allocated memory is still 155.2MB. Free memory was 105.1MB in the beginning and 41.8MB in the end (delta: 63.3MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2025-04-13 19:50:22,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.10ms. Allocated memory is still 155.2MB. Free memory was 41.8MB in the beginning and 30.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 19:50:22,949 INFO L158 Benchmark]: Boogie Preprocessor took 210.80ms. Allocated memory is still 155.2MB. Free memory was 30.7MB in the beginning and 93.5MB in the end (delta: -62.7MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2025-04-13 19:50:22,949 INFO L158 Benchmark]: RCFGBuilder took 3169.28ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 93.5MB in the beginning and 117.8MB in the end (delta: -24.4MB). Peak memory consumption was 236.5MB. Max. memory is 8.0GB. [2025-04-13 19:50:22,949 INFO L158 Benchmark]: TraceAbstraction took 708775.41ms. Allocated memory was 377.5MB in the beginning and 5.1GB in the end (delta: 4.7GB). Free memory was 117.8MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2025-04-13 19:50:22,950 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.20ms. Allocated memory is still 155.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 828.68ms. Allocated memory is still 155.2MB. Free memory was 105.1MB in the beginning and 41.8MB in the end (delta: 63.3MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 92.10ms. Allocated memory is still 155.2MB. Free memory was 41.8MB in the beginning and 30.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 210.80ms. Allocated memory is still 155.2MB. Free memory was 30.7MB in the beginning and 93.5MB in the end (delta: -62.7MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * RCFGBuilder took 3169.28ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 93.5MB in the beginning and 117.8MB in the end (delta: -24.4MB). Peak memory consumption was 236.5MB. Max. memory is 8.0GB. * TraceAbstraction took 708775.41ms. Allocated memory was 377.5MB in the beginning and 5.1GB in the end (delta: 4.7GB). Free memory was 117.8MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1793]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1952]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 180 locations, 256 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 55 SizeOfPredicates, 0 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 196 locations, 278 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 705.3s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 560.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 6662 SdHoareTripleChecker+Valid, 175.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6662 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 166.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74776 IncrementalHoareTripleChecker+Invalid, 75930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1127 mSolverCounterUnsat, 0 mSDtfsCounter, 74776 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 529 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7873 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15555occurred in iteration=15, InterpolantAutomatonStates: 343, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 84.3s SatisfiabilityAnalysisTime, 56.7s InterpolantComputationTime, 751 NumberOfCodeBlocks, 743 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 973 ConstructedInterpolants, 96 QuantifiedInterpolants, 20052 SizeOfPredicates, 715 NumberOfNonLiveVariables, 6499 ConjunctsInSsa, 1185 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 250/271 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown