/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/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:37:58,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:37:58,965 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:37:58,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:37:58,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:37:58,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:37:58,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:37:58,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:37:58,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:37:58,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:37:58,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:37:58,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:37:58,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:37:58,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:37:58,996 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:37:58,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:37:58,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:37:58,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:37:58,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:37:58,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:37:58,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:37:58,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:37:58,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:58,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:58,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:58,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:37:58,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:37:58,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:37:58,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:37:58,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:37:58,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:37:58,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:37:58,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:37:58,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:37:58,999 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:37:59,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:37:59,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:37:59,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:37:59,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:37:59,249 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:37:59,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2025-04-13 19:38:00,541 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1bae1bf/8ff5cf4afde546dc8f3eac116369770e/FLAGb752bfb34 [2025-04-13 19:38:00,807 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:38:00,808 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2025-04-13 19:38:00,833 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1bae1bf/8ff5cf4afde546dc8f3eac116369770e/FLAGb752bfb34 [2025-04-13 19:38:01,542 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1bae1bf/8ff5cf4afde546dc8f3eac116369770e [2025-04-13 19:38:01,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:38:01,545 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:38:01,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:38:01,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:38:01,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:38:01,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:38:01" (1/1) ... [2025-04-13 19:38:01,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c24be9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:01, skipping insertion in model container [2025-04-13 19:38:01,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:38:01" (1/1) ... [2025-04-13 19:38:01,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:38:01,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[186203,186216] [2025-04-13 19:38:01,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:38:01,978 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:38:02,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[186203,186216] [2025-04-13 19:38:02,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:38:02,105 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:38:02,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:02 WrapperNode [2025-04-13 19:38:02,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:38:02,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:38:02,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:38:02,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:38:02,111 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:02" (1/1) ... [2025-04-13 19:38:02,127 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:02" (1/1) ... [2025-04-13 19:38:02,154 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 126 [2025-04-13 19:38:02,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:38:02,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:38:02,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:38:02,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:38:02,162 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:02" (1/1) ... [2025-04-13 19:38:02,162 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:02" (1/1) ... [2025-04-13 19:38:02,165 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:02" (1/1) ... [2025-04-13 19:38:02,188 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2025-04-13 19:38:02,188 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:02" (1/1) ... [2025-04-13 19:38:02,188 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:02" (1/1) ... [2025-04-13 19:38:02,202 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:02" (1/1) ... [2025-04-13 19:38:02,203 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:02" (1/1) ... [2025-04-13 19:38:02,204 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:02" (1/1) ... [2025-04-13 19:38:02,210 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:02" (1/1) ... [2025-04-13 19:38:02,215 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:02" (1/1) ... [2025-04-13 19:38:02,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:38:02,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:38:02,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:38:02,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:38:02,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:02" (1/1) ... [2025-04-13 19:38:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:02,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:02,266 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:02,271 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:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-04-13 19:38:02,284 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 19:38:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:38:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:38:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:38:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:38:02,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:38:02,285 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:02,478 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:38:02,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:38:02,707 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:38:02,708 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:38:02,708 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:38:02,911 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:02,933 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:02,965 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:38:02,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:38:02 BoogieIcfgContainer [2025-04-13 19:38:02,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:38:02,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:38:02,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:38:02,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:38:02,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:38:01" (1/3) ... [2025-04-13 19:38:02,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f149174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:38:02, skipping insertion in model container [2025-04-13 19:38:02,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:02" (2/3) ... [2025-04-13 19:38:02,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f149174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:38:02, skipping insertion in model container [2025-04-13 19:38:02,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:38:02" (3/3) ... [2025-04-13 19:38:02,973 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2025-04-13 19:38:02,983 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:38:02,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_1-container_of.i that has 2 procedures, 22 locations, 27 edges, 1 initial locations, 0 loop locations, and 6 error locations. [2025-04-13 19:38:02,984 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:38:03,033 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:38:03,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 34 transitions, 82 flow [2025-04-13 19:38:03,083 INFO L116 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-04-13 19:38:03,084 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:38:03,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 3/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 58 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2025-04-13 19:38:03,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 34 transitions, 82 flow [2025-04-13 19:38:03,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 68 flow [2025-04-13 19:38:03,096 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:38:03,109 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;@16b312d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:38:03,109 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 19:38:03,111 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:38:03,111 INFO L116 PetriNetUnfolderBase]: 0/0 cut-off events. [2025-04-13 19:38:03,111 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:38:03,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:03,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-13 19:38:03,114 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:03,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 459, now seen corresponding path program 1 times [2025-04-13 19:38:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:03,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166214066] [2025-04-13 19:38:03,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:03,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 19:38:03,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 19:38:03,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:03,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:03,560 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:03,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:03,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166214066] [2025-04-13 19:38:03,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166214066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:03,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:03,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 19:38:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111519741] [2025-04-13 19:38:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:03,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:38:03,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:03,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:38:03,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:38:03,588 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:03,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:03,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:03,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:03,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:03,703 INFO L116 PetriNetUnfolderBase]: 105/205 cut-off events. [2025-04-13 19:38:03,703 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:38:03,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 205 events. 105/205 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 602 event pairs, 105 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 368. Up to 206 conditions per place. [2025-04-13 19:38:03,707 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 20 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-04-13 19:38:03,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 92 flow [2025-04-13 19:38:03,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:38:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:38:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-04-13 19:38:03,719 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-13 19:38:03,720 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 68 flow. Second operand 2 states and 32 transitions. [2025-04-13 19:38:03,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 92 flow [2025-04-13 19:38:03,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:03,727 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 44 flow [2025-04-13 19:38:03,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-04-13 19:38:03,731 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -7 predicate places. [2025-04-13 19:38:03,732 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 44 flow [2025-04-13 19:38:03,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:03,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:03,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:03,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:38:03,732 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:03,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1126117092, now seen corresponding path program 1 times [2025-04-13 19:38:03,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:03,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258662297] [2025-04-13 19:38:03,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:03,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:03,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:03,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:03,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:04,299 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:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:04,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258662297] [2025-04-13 19:38:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258662297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:04,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:04,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:38:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186398038] [2025-04-13 19:38:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:04,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:38:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:04,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:38:04,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:38:04,302 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:04,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 44 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:38:04,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:04,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:04,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:04,725 INFO L116 PetriNetUnfolderBase]: 217/420 cut-off events. [2025-04-13 19:38:04,726 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:38:04,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 420 events. 217/420 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1861 event pairs, 0 based on Foata normal form. 4/422 useless extension candidates. Maximal degree in co-relation 847. Up to 123 conditions per place. [2025-04-13 19:38:04,732 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 64 selfloop transitions, 18 changer transitions 0/82 dead transitions. [2025-04-13 19:38:04,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 82 transitions, 335 flow [2025-04-13 19:38:04,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:38:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:38:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2025-04-13 19:38:04,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3058823529411765 [2025-04-13 19:38:04,733 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 44 flow. Second operand 10 states and 104 transitions. [2025-04-13 19:38:04,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 82 transitions, 335 flow [2025-04-13 19:38:04,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 82 transitions, 335 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:38:04,736 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 174 flow [2025-04-13 19:38:04,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=174, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-04-13 19:38:04,736 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2025-04-13 19:38:04,736 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 174 flow [2025-04-13 19:38:04,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:38:04,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:04,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:04,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:38:04,737 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:04,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash 245471760, now seen corresponding path program 2 times [2025-04-13 19:38:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:04,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873469975] [2025-04-13 19:38:04,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:04,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:04,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:04,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:04,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:05,188 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:05,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:05,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873469975] [2025-04-13 19:38:05,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873469975] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:05,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:05,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:38:05,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23825159] [2025-04-13 19:38:05,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:05,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:38:05,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:05,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:38:05,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:38:05,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:05,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:38:05,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:05,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:05,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:05,448 INFO L116 PetriNetUnfolderBase]: 260/515 cut-off events. [2025-04-13 19:38:05,448 INFO L117 PetriNetUnfolderBase]: For 849/849 co-relation queries the response was YES. [2025-04-13 19:38:05,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 515 events. 260/515 cut-off events. For 849/849 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2394 event pairs, 3 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 1721. Up to 167 conditions per place. [2025-04-13 19:38:05,455 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 68 selfloop transitions, 18 changer transitions 0/86 dead transitions. [2025-04-13 19:38:05,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 86 transitions, 580 flow [2025-04-13 19:38:05,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:38:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:38:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2025-04-13 19:38:05,459 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27124183006535946 [2025-04-13 19:38:05,459 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 174 flow. Second operand 9 states and 83 transitions. [2025-04-13 19:38:05,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 86 transitions, 580 flow [2025-04-13 19:38:05,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 86 transitions, 576 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:38:05,465 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 266 flow [2025-04-13 19:38:05,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=266, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-04-13 19:38:05,467 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2025-04-13 19:38:05,467 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 266 flow [2025-04-13 19:38:05,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:38:05,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:05,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:05,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:38:05,467 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:05,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 245471761, now seen corresponding path program 1 times [2025-04-13 19:38:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:05,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270653856] [2025-04-13 19:38:05,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:05,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:05,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:05,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:05,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:06,266 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:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:06,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270653856] [2025-04-13 19:38:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270653856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:06,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:06,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:06,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049505221] [2025-04-13 19:38:06,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:06,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:38:06,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:06,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:38:06,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:38:06,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:06,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 266 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:06,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:06,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:06,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:06,621 INFO L116 PetriNetUnfolderBase]: 293/585 cut-off events. [2025-04-13 19:38:06,621 INFO L117 PetriNetUnfolderBase]: For 1546/1546 co-relation queries the response was YES. [2025-04-13 19:38:06,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2224 conditions, 585 events. 293/585 cut-off events. For 1546/1546 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2710 event pairs, 41 based on Foata normal form. 1/586 useless extension candidates. Maximal degree in co-relation 2209. Up to 371 conditions per place. [2025-04-13 19:38:06,624 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 58 selfloop transitions, 26 changer transitions 17/101 dead transitions. [2025-04-13 19:38:06,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 813 flow [2025-04-13 19:38:06,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2025-04-13 19:38:06,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22459893048128343 [2025-04-13 19:38:06,625 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 266 flow. Second operand 11 states and 84 transitions. [2025-04-13 19:38:06,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 813 flow [2025-04-13 19:38:06,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 101 transitions, 780 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-13 19:38:06,631 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 481 flow [2025-04-13 19:38:06,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=481, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2025-04-13 19:38:06,634 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2025-04-13 19:38:06,634 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 481 flow [2025-04-13 19:38:06,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:06,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:06,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:06,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:38:06,635 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:06,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:06,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1470337745, now seen corresponding path program 2 times [2025-04-13 19:38:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:06,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985237592] [2025-04-13 19:38:06,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:06,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:06,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:06,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:06,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:06,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:06,891 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:06,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:06,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985237592] [2025-04-13 19:38:06,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985237592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:06,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:06,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:38:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644616664] [2025-04-13 19:38:06,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:06,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:38:06,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:06,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:38:06,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:38:06,893 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:06,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:38:06,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:06,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:06,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:07,174 INFO L116 PetriNetUnfolderBase]: 238/487 cut-off events. [2025-04-13 19:38:07,174 INFO L117 PetriNetUnfolderBase]: For 1821/1821 co-relation queries the response was YES. [2025-04-13 19:38:07,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 487 events. 238/487 cut-off events. For 1821/1821 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2189 event pairs, 30 based on Foata normal form. 4/491 useless extension candidates. Maximal degree in co-relation 2067. Up to 307 conditions per place. [2025-04-13 19:38:07,179 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 61 selfloop transitions, 43 changer transitions 3/107 dead transitions. [2025-04-13 19:38:07,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 107 transitions, 1051 flow [2025-04-13 19:38:07,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:38:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:38:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2025-04-13 19:38:07,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26143790849673204 [2025-04-13 19:38:07,182 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 481 flow. Second operand 9 states and 80 transitions. [2025-04-13 19:38:07,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 107 transitions, 1051 flow [2025-04-13 19:38:07,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 107 transitions, 1003 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-04-13 19:38:07,190 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 830 flow [2025-04-13 19:38:07,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=830, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2025-04-13 19:38:07,191 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2025-04-13 19:38:07,191 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 830 flow [2025-04-13 19:38:07,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:38:07,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:07,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:07,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:38:07,192 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:07,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -870666623, now seen corresponding path program 3 times [2025-04-13 19:38:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:07,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938278278] [2025-04-13 19:38:07,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:07,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:07,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 19:38:07,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:38:07,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:38:07,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:07,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938278278] [2025-04-13 19:38:07,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938278278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:07,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:07,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:38:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716806687] [2025-04-13 19:38:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:07,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:38:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:07,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:38:07,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:38:07,421 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:07,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 830 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:38:07,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:07,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:07,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:07,715 INFO L116 PetriNetUnfolderBase]: 264/541 cut-off events. [2025-04-13 19:38:07,715 INFO L117 PetriNetUnfolderBase]: For 3027/3027 co-relation queries the response was YES. [2025-04-13 19:38:07,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 541 events. 264/541 cut-off events. For 3027/3027 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2523 event pairs, 29 based on Foata normal form. 4/545 useless extension candidates. Maximal degree in co-relation 2652. Up to 248 conditions per place. [2025-04-13 19:38:07,719 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 76 selfloop transitions, 76 changer transitions 0/152 dead transitions. [2025-04-13 19:38:07,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 152 transitions, 1730 flow [2025-04-13 19:38:07,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2025-04-13 19:38:07,720 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25133689839572193 [2025-04-13 19:38:07,720 INFO L175 Difference]: Start difference. First operand has 71 places, 84 transitions, 830 flow. Second operand 11 states and 94 transitions. [2025-04-13 19:38:07,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 152 transitions, 1730 flow [2025-04-13 19:38:07,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 1670 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-04-13 19:38:07,729 INFO L231 Difference]: Finished difference. Result has 84 places, 116 transitions, 1357 flow [2025-04-13 19:38:07,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1357, PETRI_PLACES=84, PETRI_TRANSITIONS=116} [2025-04-13 19:38:07,730 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2025-04-13 19:38:07,730 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 116 transitions, 1357 flow [2025-04-13 19:38:07,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:38:07,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:07,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:07,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:38:07,731 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:07,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1242721347, now seen corresponding path program 4 times [2025-04-13 19:38:07,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:07,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61514648] [2025-04-13 19:38:07,731 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:38:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:07,748 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:07,760 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:07,760 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:38:07,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:08,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:08,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61514648] [2025-04-13 19:38:08,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61514648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:08,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736270476] [2025-04-13 19:38:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:08,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:38:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:08,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:38:08,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:38:08,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:08,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 116 transitions, 1357 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:08,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:08,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:08,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:08,859 INFO L116 PetriNetUnfolderBase]: 292/604 cut-off events. [2025-04-13 19:38:08,859 INFO L117 PetriNetUnfolderBase]: For 4602/4602 co-relation queries the response was YES. [2025-04-13 19:38:08,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 604 events. 292/604 cut-off events. For 4602/4602 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2936 event pairs, 43 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 3279. Up to 306 conditions per place. [2025-04-13 19:38:08,864 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 120 selfloop transitions, 43 changer transitions 34/197 dead transitions. [2025-04-13 19:38:08,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 197 transitions, 2529 flow [2025-04-13 19:38:08,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:38:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:38:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2025-04-13 19:38:08,866 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25245098039215685 [2025-04-13 19:38:08,866 INFO L175 Difference]: Start difference. First operand has 84 places, 116 transitions, 1357 flow. Second operand 12 states and 103 transitions. [2025-04-13 19:38:08,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 197 transitions, 2529 flow [2025-04-13 19:38:08,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 197 transitions, 2334 flow, removed 53 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:08,880 INFO L231 Difference]: Finished difference. Result has 96 places, 124 transitions, 1410 flow [2025-04-13 19:38:08,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1410, PETRI_PLACES=96, PETRI_TRANSITIONS=124} [2025-04-13 19:38:08,881 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2025-04-13 19:38:08,881 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 124 transitions, 1410 flow [2025-04-13 19:38:08,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:08,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:08,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:08,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:38:08,881 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:08,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash -790155299, now seen corresponding path program 5 times [2025-04-13 19:38:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:08,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101608366] [2025-04-13 19:38:08,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:38:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:08,899 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:08,906 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:08,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:38:08,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:38:09,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:09,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101608366] [2025-04-13 19:38:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101608366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:09,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:09,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:38:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336429600] [2025-04-13 19:38:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:09,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:38:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:09,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:38:09,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:38:09,160 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:09,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 124 transitions, 1410 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:38:09,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:09,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:09,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:09,473 INFO L116 PetriNetUnfolderBase]: 303/644 cut-off events. [2025-04-13 19:38:09,473 INFO L117 PetriNetUnfolderBase]: For 3738/3738 co-relation queries the response was YES. [2025-04-13 19:38:09,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3425 conditions, 644 events. 303/644 cut-off events. For 3738/3738 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3233 event pairs, 50 based on Foata normal form. 9/653 useless extension candidates. Maximal degree in co-relation 3390. Up to 310 conditions per place. [2025-04-13 19:38:09,478 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 105 selfloop transitions, 83 changer transitions 0/188 dead transitions. [2025-04-13 19:38:09,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 188 transitions, 2297 flow [2025-04-13 19:38:09,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2025-04-13 19:38:09,479 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28609625668449196 [2025-04-13 19:38:09,479 INFO L175 Difference]: Start difference. First operand has 96 places, 124 transitions, 1410 flow. Second operand 11 states and 107 transitions. [2025-04-13 19:38:09,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 188 transitions, 2297 flow [2025-04-13 19:38:09,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 188 transitions, 2263 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:09,494 INFO L231 Difference]: Finished difference. Result has 107 places, 143 transitions, 1932 flow [2025-04-13 19:38:09,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1932, PETRI_PLACES=107, PETRI_TRANSITIONS=143} [2025-04-13 19:38:09,495 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2025-04-13 19:38:09,495 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 143 transitions, 1932 flow [2025-04-13 19:38:09,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:38:09,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:09,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:09,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:38:09,495 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:09,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1229821189, now seen corresponding path program 6 times [2025-04-13 19:38:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:09,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343673629] [2025-04-13 19:38:09,496 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:38:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:09,517 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:09,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:09,531 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:38:09,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:38:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:09,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343673629] [2025-04-13 19:38:09,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343673629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:09,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:09,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228024981] [2025-04-13 19:38:09,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:09,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:38:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:09,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:38:09,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:38:09,766 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:09,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 143 transitions, 1932 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:38:09,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:09,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:09,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:10,388 INFO L116 PetriNetUnfolderBase]: 307/657 cut-off events. [2025-04-13 19:38:10,389 INFO L117 PetriNetUnfolderBase]: For 6151/6151 co-relation queries the response was YES. [2025-04-13 19:38:10,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 657 events. 307/657 cut-off events. For 6151/6151 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3371 event pairs, 69 based on Foata normal form. 5/662 useless extension candidates. Maximal degree in co-relation 3927. Up to 245 conditions per place. [2025-04-13 19:38:10,394 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 101 selfloop transitions, 113 changer transitions 1/215 dead transitions. [2025-04-13 19:38:10,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 215 transitions, 3113 flow [2025-04-13 19:38:10,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 19:38:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 19:38:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 170 transitions. [2025-04-13 19:38:10,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2 [2025-04-13 19:38:10,396 INFO L175 Difference]: Start difference. First operand has 107 places, 143 transitions, 1932 flow. Second operand 25 states and 170 transitions. [2025-04-13 19:38:10,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 215 transitions, 3113 flow [2025-04-13 19:38:10,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 215 transitions, 2981 flow, removed 38 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:10,416 INFO L231 Difference]: Finished difference. Result has 134 places, 173 transitions, 2522 flow [2025-04-13 19:38:10,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2522, PETRI_PLACES=134, PETRI_TRANSITIONS=173} [2025-04-13 19:38:10,417 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2025-04-13 19:38:10,417 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 173 transitions, 2522 flow [2025-04-13 19:38:10,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:38:10,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:10,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:10,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:38:10,417 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:10,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1064735327, now seen corresponding path program 7 times [2025-04-13 19:38:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:10,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397005902] [2025-04-13 19:38:10,418 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:38:10,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:10,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:10,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:10,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:10,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:10,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397005902] [2025-04-13 19:38:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397005902] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:38:10,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758391964] [2025-04-13 19:38:10,962 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:38:10,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:10,964 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:10,966 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:11,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:11,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:11,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:11,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:11,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 19:38:11,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:38:11,162 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 19:38:11,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-04-13 19:38:11,271 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 22 treesize of output 18 [2025-04-13 19:38:11,331 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:38:11,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-04-13 19:38:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:11,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:38:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758391964] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:38:11,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:38:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-04-13 19:38:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512963485] [2025-04-13 19:38:11,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:38:11,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 19:38:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:11,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 19:38:11,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-04-13 19:38:11,580 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:11,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 173 transitions, 2522 flow. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 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:11,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:11,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:11,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:12,377 INFO L116 PetriNetUnfolderBase]: 306/652 cut-off events. [2025-04-13 19:38:12,378 INFO L117 PetriNetUnfolderBase]: For 7030/7030 co-relation queries the response was YES. [2025-04-13 19:38:12,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4253 conditions, 652 events. 306/652 cut-off events. For 7030/7030 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3312 event pairs, 72 based on Foata normal form. 2/654 useless extension candidates. Maximal degree in co-relation 4206. Up to 449 conditions per place. [2025-04-13 19:38:12,383 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 118 selfloop transitions, 62 changer transitions 27/207 dead transitions. [2025-04-13 19:38:12,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 207 transitions, 3286 flow [2025-04-13 19:38:12,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:38:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:38:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2025-04-13 19:38:12,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23284313725490197 [2025-04-13 19:38:12,384 INFO L175 Difference]: Start difference. First operand has 134 places, 173 transitions, 2522 flow. Second operand 12 states and 95 transitions. [2025-04-13 19:38:12,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 207 transitions, 3286 flow [2025-04-13 19:38:12,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 207 transitions, 2904 flow, removed 91 selfloop flow, removed 11 redundant places. [2025-04-13 19:38:12,409 INFO L231 Difference]: Finished difference. Result has 136 places, 167 transitions, 2231 flow [2025-04-13 19:38:12,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2231, PETRI_PLACES=136, PETRI_TRANSITIONS=167} [2025-04-13 19:38:12,411 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2025-04-13 19:38:12,411 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 167 transitions, 2231 flow [2025-04-13 19:38:12,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 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:12,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:12,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:12,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 19:38:12,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 19:38:12,612 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:12,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1640090769, now seen corresponding path program 8 times [2025-04-13 19:38:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:12,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014032684] [2025-04-13 19:38:12,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:12,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:12,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:12,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:12,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:38:12,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:38:12,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:12,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014032684] [2025-04-13 19:38:12,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014032684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:12,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:12,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:38:12,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088301357] [2025-04-13 19:38:12,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:12,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:12,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:12,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:12,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:12,798 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:12,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 167 transitions, 2231 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:38:12,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:12,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:12,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:13,243 INFO L116 PetriNetUnfolderBase]: 214/471 cut-off events. [2025-04-13 19:38:13,243 INFO L117 PetriNetUnfolderBase]: For 4502/4502 co-relation queries the response was YES. [2025-04-13 19:38:13,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 471 events. 214/471 cut-off events. For 4502/4502 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2185 event pairs, 42 based on Foata normal form. 9/480 useless extension candidates. Maximal degree in co-relation 2952. Up to 122 conditions per place. [2025-04-13 19:38:13,247 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 102 selfloop transitions, 98 changer transitions 0/200 dead transitions. [2025-04-13 19:38:13,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 200 transitions, 2803 flow [2025-04-13 19:38:13,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 19:38:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 19:38:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 165 transitions. [2025-04-13 19:38:13,248 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23109243697478993 [2025-04-13 19:38:13,248 INFO L175 Difference]: Start difference. First operand has 136 places, 167 transitions, 2231 flow. Second operand 21 states and 165 transitions. [2025-04-13 19:38:13,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 200 transitions, 2803 flow [2025-04-13 19:38:13,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 200 transitions, 2584 flow, removed 28 selfloop flow, removed 11 redundant places. [2025-04-13 19:38:13,263 INFO L231 Difference]: Finished difference. Result has 154 places, 168 transitions, 2371 flow [2025-04-13 19:38:13,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1917, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2371, PETRI_PLACES=154, PETRI_TRANSITIONS=168} [2025-04-13 19:38:13,264 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2025-04-13 19:38:13,264 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 168 transitions, 2371 flow [2025-04-13 19:38:13,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:38:13,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:13,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:13,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:38:13,264 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:13,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1093825817, now seen corresponding path program 9 times [2025-04-13 19:38:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:13,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411508034] [2025-04-13 19:38:13,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:13,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:13,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:13,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:38:13,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:13,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411508034] [2025-04-13 19:38:13,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411508034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:38:13,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151781533] [2025-04-13 19:38:13,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:13,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:13,722 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:38:13,724 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:38:13,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:13,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:13,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:38:13,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:13,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 19:38:13,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:38:13,965 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 19:38:13,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-04-13 19:38:14,140 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 22 treesize of output 18 [2025-04-13 19:38:14,187 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:38:14,187 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-04-13 19:38:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:14,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:38:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:14,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151781533] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:38:14,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:38:14,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2025-04-13 19:38:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739879560] [2025-04-13 19:38:14,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:38:14,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 19:38:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:14,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 19:38:14,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:38:14,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:14,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 168 transitions, 2371 flow. Second operand has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 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:14,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:14,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:14,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:15,339 INFO L116 PetriNetUnfolderBase]: 245/544 cut-off events. [2025-04-13 19:38:15,339 INFO L117 PetriNetUnfolderBase]: For 7066/7066 co-relation queries the response was YES. [2025-04-13 19:38:15,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3546 conditions, 544 events. 245/544 cut-off events. For 7066/7066 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2676 event pairs, 84 based on Foata normal form. 2/546 useless extension candidates. Maximal degree in co-relation 3496. Up to 376 conditions per place. [2025-04-13 19:38:15,343 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 123 selfloop transitions, 45 changer transitions 35/203 dead transitions. [2025-04-13 19:38:15,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 203 transitions, 3186 flow [2025-04-13 19:38:15,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:38:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:38:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2025-04-13 19:38:15,345 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2426470588235294 [2025-04-13 19:38:15,345 INFO L175 Difference]: Start difference. First operand has 154 places, 168 transitions, 2371 flow. Second operand 12 states and 99 transitions. [2025-04-13 19:38:15,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 203 transitions, 3186 flow [2025-04-13 19:38:15,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 203 transitions, 2966 flow, removed 64 selfloop flow, removed 9 redundant places. [2025-04-13 19:38:15,366 INFO L231 Difference]: Finished difference. Result has 158 places, 160 transitions, 2162 flow [2025-04-13 19:38:15,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2162, PETRI_PLACES=158, PETRI_TRANSITIONS=160} [2025-04-13 19:38:15,366 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2025-04-13 19:38:15,366 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 160 transitions, 2162 flow [2025-04-13 19:38:15,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 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:15,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:15,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:15,374 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:38:15,567 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,SelfDestructingSolverStorable11 [2025-04-13 19:38:15,567 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:15,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1660040883, now seen corresponding path program 10 times [2025-04-13 19:38:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:15,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035996447] [2025-04-13 19:38:15,568 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:38:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:15,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:15,594 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:15,594 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:38:15,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:16,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:16,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035996447] [2025-04-13 19:38:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035996447] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:38:16,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877005509] [2025-04-13 19:38:16,119 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:38:16,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:16,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:16,121 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:38:16,122 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:38:16,223 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:16,250 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:16,250 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:38:16,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:16,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 19:38:16,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:38:16,266 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 19:38:16,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-04-13 19:38:16,355 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 22 treesize of output 18 [2025-04-13 19:38:16,390 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:38:16,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-04-13 19:38:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:16,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:38:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:16,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877005509] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:38:16,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:38:16,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-04-13 19:38:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087161999] [2025-04-13 19:38:16,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:38:16,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 19:38:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:16,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 19:38:16,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-04-13 19:38:16,603 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:16,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 160 transitions, 2162 flow. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 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:16,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:16,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:16,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:17,247 INFO L116 PetriNetUnfolderBase]: 206/456 cut-off events. [2025-04-13 19:38:17,247 INFO L117 PetriNetUnfolderBase]: For 5117/5117 co-relation queries the response was YES. [2025-04-13 19:38:17,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 456 events. 206/456 cut-off events. For 5117/5117 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2087 event pairs, 69 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 2849. Up to 284 conditions per place. [2025-04-13 19:38:17,252 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 112 selfloop transitions, 40 changer transitions 27/179 dead transitions. [2025-04-13 19:38:17,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 2691 flow [2025-04-13 19:38:17,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:38:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:38:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 98 transitions. [2025-04-13 19:38:17,253 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22171945701357465 [2025-04-13 19:38:17,253 INFO L175 Difference]: Start difference. First operand has 158 places, 160 transitions, 2162 flow. Second operand 13 states and 98 transitions. [2025-04-13 19:38:17,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 2691 flow [2025-04-13 19:38:17,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 179 transitions, 2537 flow, removed 27 selfloop flow, removed 16 redundant places. [2025-04-13 19:38:17,272 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 1933 flow [2025-04-13 19:38:17,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1933, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2025-04-13 19:38:17,273 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2025-04-13 19:38:17,273 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 1933 flow [2025-04-13 19:38:17,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 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:17,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:17,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:17,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:38:17,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:17,474 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:17,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:17,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1547365215, now seen corresponding path program 11 times [2025-04-13 19:38:17,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:17,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503336372] [2025-04-13 19:38:17,475 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:38:17,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:17,496 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:17,508 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:17,508 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:38:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:18,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:18,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503336372] [2025-04-13 19:38:18,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503336372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:18,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:18,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671820940] [2025-04-13 19:38:18,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:18,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:38:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:18,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:38:18,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:38:18,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:18,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 1933 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:18,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:18,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:18,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:18,391 INFO L116 PetriNetUnfolderBase]: 217/478 cut-off events. [2025-04-13 19:38:18,392 INFO L117 PetriNetUnfolderBase]: For 4342/4342 co-relation queries the response was YES. [2025-04-13 19:38:18,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 478 events. 217/478 cut-off events. For 4342/4342 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2221 event pairs, 44 based on Foata normal form. 1/479 useless extension candidates. Maximal degree in co-relation 2844. Up to 324 conditions per place. [2025-04-13 19:38:18,396 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 129 selfloop transitions, 58 changer transitions 0/187 dead transitions. [2025-04-13 19:38:18,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 187 transitions, 2649 flow [2025-04-13 19:38:18,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2025-04-13 19:38:18,397 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24331550802139038 [2025-04-13 19:38:18,397 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 1933 flow. Second operand 11 states and 91 transitions. [2025-04-13 19:38:18,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 187 transitions, 2649 flow [2025-04-13 19:38:18,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 187 transitions, 2535 flow, removed 14 selfloop flow, removed 12 redundant places. [2025-04-13 19:38:18,414 INFO L231 Difference]: Finished difference. Result has 145 places, 157 transitions, 2116 flow [2025-04-13 19:38:18,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2116, PETRI_PLACES=145, PETRI_TRANSITIONS=157} [2025-04-13 19:38:18,415 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 114 predicate places. [2025-04-13 19:38:18,415 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 157 transitions, 2116 flow [2025-04-13 19:38:18,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:18,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:18,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:18,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:38:18,416 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:18,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1118249570, now seen corresponding path program 3 times [2025-04-13 19:38:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:18,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622940540] [2025-04-13 19:38:18,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:18,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:18,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:18,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:18,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:38:18,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:18,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:18,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622940540] [2025-04-13 19:38:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622940540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:18,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:18,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:18,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381295171] [2025-04-13 19:38:18,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:18,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:18,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:18,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:18,693 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:18,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 157 transitions, 2116 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:38:18,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:18,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:18,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:19,009 INFO L116 PetriNetUnfolderBase]: 221/490 cut-off events. [2025-04-13 19:38:19,009 INFO L117 PetriNetUnfolderBase]: For 4310/4310 co-relation queries the response was YES. [2025-04-13 19:38:19,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 490 events. 221/490 cut-off events. For 4310/4310 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2324 event pairs, 9 based on Foata normal form. 3/493 useless extension candidates. Maximal degree in co-relation 2891. Up to 153 conditions per place. [2025-04-13 19:38:19,013 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 82 selfloop transitions, 80 changer transitions 16/178 dead transitions. [2025-04-13 19:38:19,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 178 transitions, 2565 flow [2025-04-13 19:38:19,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:38:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:38:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2025-04-13 19:38:19,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.21266968325791855 [2025-04-13 19:38:19,015 INFO L175 Difference]: Start difference. First operand has 145 places, 157 transitions, 2116 flow. Second operand 13 states and 94 transitions. [2025-04-13 19:38:19,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 178 transitions, 2565 flow [2025-04-13 19:38:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 178 transitions, 2443 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-13 19:38:19,033 INFO L231 Difference]: Finished difference. Result has 151 places, 141 transitions, 1989 flow [2025-04-13 19:38:19,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1989, PETRI_PLACES=151, PETRI_TRANSITIONS=141} [2025-04-13 19:38:19,033 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2025-04-13 19:38:19,033 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 141 transitions, 1989 flow [2025-04-13 19:38:19,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:38:19,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:19,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:19,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:38:19,034 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:19,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash -826119459, now seen corresponding path program 12 times [2025-04-13 19:38:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:19,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080239246] [2025-04-13 19:38:19,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:38:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:19,045 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:19,051 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:19,051 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:38:19,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:19,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:19,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080239246] [2025-04-13 19:38:19,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080239246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:38:19,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197639220] [2025-04-13 19:38:19,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:38:19,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:19,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:19,460 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:38:19,461 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:38:19,574 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:19,677 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:19,677 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 19:38:19,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:19,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 19:38:19,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:38:19,688 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 19:38:19,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-04-13 19:38:19,812 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 22 treesize of output 18 [2025-04-13 19:38:19,860 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:38:19,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-04-13 19:38:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:19,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:38:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197639220] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:38:20,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:38:20,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2025-04-13 19:38:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662132258] [2025-04-13 19:38:20,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:38:20,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 19:38:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:20,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 19:38:20,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:38:20,099 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:20,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 141 transitions, 1989 flow. Second operand has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 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:20,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:20,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:20,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:20,669 INFO L116 PetriNetUnfolderBase]: 180/401 cut-off events. [2025-04-13 19:38:20,669 INFO L117 PetriNetUnfolderBase]: For 4370/4370 co-relation queries the response was YES. [2025-04-13 19:38:20,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 401 events. 180/401 cut-off events. For 4370/4370 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1752 event pairs, 56 based on Foata normal form. 2/403 useless extension candidates. Maximal degree in co-relation 2498. Up to 276 conditions per place. [2025-04-13 19:38:20,672 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 83 selfloop transitions, 29 changer transitions 37/149 dead transitions. [2025-04-13 19:38:20,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 149 transitions, 2333 flow [2025-04-13 19:38:20,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:38:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:38:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2025-04-13 19:38:20,673 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.19117647058823528 [2025-04-13 19:38:20,673 INFO L175 Difference]: Start difference. First operand has 151 places, 141 transitions, 1989 flow. Second operand 12 states and 78 transitions. [2025-04-13 19:38:20,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 149 transitions, 2333 flow [2025-04-13 19:38:20,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 149 transitions, 2043 flow, removed 16 selfloop flow, removed 18 redundant places. [2025-04-13 19:38:20,686 INFO L231 Difference]: Finished difference. Result has 138 places, 108 transitions, 1332 flow [2025-04-13 19:38:20,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1332, PETRI_PLACES=138, PETRI_TRANSITIONS=108} [2025-04-13 19:38:20,686 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2025-04-13 19:38:20,686 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 108 transitions, 1332 flow [2025-04-13 19:38:20,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 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:20,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:20,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:20,693 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:38:20,887 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:38:20,887 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:20,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1803539971, now seen corresponding path program 13 times [2025-04-13 19:38:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:20,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909520609] [2025-04-13 19:38:20,888 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:38:20,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:20,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:20,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:20,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:20,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:21,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909520609] [2025-04-13 19:38:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909520609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:21,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007006595] [2025-04-13 19:38:21,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:21,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:38:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:21,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:38:21,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:38:21,309 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:21,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 108 transitions, 1332 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:21,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:21,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:21,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:21,579 INFO L116 PetriNetUnfolderBase]: 160/350 cut-off events. [2025-04-13 19:38:21,579 INFO L117 PetriNetUnfolderBase]: For 2886/2886 co-relation queries the response was YES. [2025-04-13 19:38:21,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 350 events. 160/350 cut-off events. For 2886/2886 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1462 event pairs, 32 based on Foata normal form. 1/351 useless extension candidates. Maximal degree in co-relation 1994. Up to 179 conditions per place. [2025-04-13 19:38:21,581 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 78 selfloop transitions, 23 changer transitions 37/138 dead transitions. [2025-04-13 19:38:21,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 138 transitions, 1869 flow [2025-04-13 19:38:21,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:38:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:38:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2025-04-13 19:38:21,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22941176470588234 [2025-04-13 19:38:21,582 INFO L175 Difference]: Start difference. First operand has 138 places, 108 transitions, 1332 flow. Second operand 10 states and 78 transitions. [2025-04-13 19:38:21,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 138 transitions, 1869 flow [2025-04-13 19:38:21,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 138 transitions, 1599 flow, removed 23 selfloop flow, removed 20 redundant places. [2025-04-13 19:38:21,590 INFO L231 Difference]: Finished difference. Result has 114 places, 93 transitions, 985 flow [2025-04-13 19:38:21,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=985, PETRI_PLACES=114, PETRI_TRANSITIONS=93} [2025-04-13 19:38:21,591 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 83 predicate places. [2025-04-13 19:38:21,591 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 93 transitions, 985 flow [2025-04-13 19:38:21,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:21,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:21,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:21,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 19:38:21,591 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:21,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1680175563, now seen corresponding path program 14 times [2025-04-13 19:38:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:21,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982156662] [2025-04-13 19:38:21,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:21,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:21,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:21,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:38:21,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:21,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:21,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982156662] [2025-04-13 19:38:21,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982156662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:21,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:21,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:21,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446590538] [2025-04-13 19:38:21,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:21,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:38:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:21,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:38:21,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:38:21,994 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:21,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 93 transitions, 985 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:21,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:21,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:21,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:22,246 INFO L116 PetriNetUnfolderBase]: 118/262 cut-off events. [2025-04-13 19:38:22,246 INFO L117 PetriNetUnfolderBase]: For 1481/1481 co-relation queries the response was YES. [2025-04-13 19:38:22,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 262 events. 118/262 cut-off events. For 1481/1481 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 992 event pairs, 28 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 1375. Up to 108 conditions per place. [2025-04-13 19:38:22,248 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 34 selfloop transitions, 7 changer transitions 67/108 dead transitions. [2025-04-13 19:38:22,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 108 transitions, 1282 flow [2025-04-13 19:38:22,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2025-04-13 19:38:22,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.20320855614973263 [2025-04-13 19:38:22,249 INFO L175 Difference]: Start difference. First operand has 114 places, 93 transitions, 985 flow. Second operand 11 states and 76 transitions. [2025-04-13 19:38:22,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 108 transitions, 1282 flow [2025-04-13 19:38:22,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 1138 flow, removed 1 selfloop flow, removed 17 redundant places. [2025-04-13 19:38:22,254 INFO L231 Difference]: Finished difference. Result has 106 places, 41 transitions, 323 flow [2025-04-13 19:38:22,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=323, PETRI_PLACES=106, PETRI_TRANSITIONS=41} [2025-04-13 19:38:22,255 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2025-04-13 19:38:22,255 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 41 transitions, 323 flow [2025-04-13 19:38:22,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:22,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:22,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:22,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 19:38:22,255 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:22,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 83797729, now seen corresponding path program 15 times [2025-04-13 19:38:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:22,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251294888] [2025-04-13 19:38:22,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:22,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:22,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:22,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:38:22,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:22,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:22,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251294888] [2025-04-13 19:38:22,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251294888] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:38:22,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230752498] [2025-04-13 19:38:22,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:22,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:22,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:22,706 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:38:22,708 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:38:22,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:22,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:22,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:38:22,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:22,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 19:38:22,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:38:22,961 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 19:38:22,962 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-04-13 19:38:23,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-04-13 19:38:23,150 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:38:23,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-04-13 19:38:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:23,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:38:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:38:23,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230752498] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:38:23,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:38:23,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2025-04-13 19:38:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824311316] [2025-04-13 19:38:23,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:38:23,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 19:38:23,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:23,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 19:38:23,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:38:23,348 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:23,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 41 transitions, 323 flow. Second operand has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 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:23,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:23,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:23,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:23,715 INFO L116 PetriNetUnfolderBase]: 48/112 cut-off events. [2025-04-13 19:38:23,715 INFO L117 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2025-04-13 19:38:23,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 112 events. 48/112 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 295 event pairs, 6 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 504. Up to 45 conditions per place. [2025-04-13 19:38:23,715 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 0 selfloop transitions, 0 changer transitions 46/46 dead transitions. [2025-04-13 19:38:23,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 46 transitions, 424 flow [2025-04-13 19:38:23,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2025-04-13 19:38:23,717 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.14705882352941177 [2025-04-13 19:38:23,717 INFO L175 Difference]: Start difference. First operand has 106 places, 41 transitions, 323 flow. Second operand 11 states and 55 transitions. [2025-04-13 19:38:23,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 46 transitions, 424 flow [2025-04-13 19:38:23,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 46 transitions, 287 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-04-13 19:38:23,718 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2025-04-13 19:38:23,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2025-04-13 19:38:23,718 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 34 predicate places. [2025-04-13 19:38:23,718 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2025-04-13 19:38:23,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 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:23,720 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-13 19:38:23,721 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 19:38:23,721 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 19:38:23,721 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 19:38:23,721 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 19:38:23,721 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 19:38:23,721 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-04-13 19:38:23,721 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-13 19:38:23,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:38:23,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:38:23,922 INFO L422 BasicCegarLoop]: Path program histogram: [15, 3, 1] [2025-04-13 19:38:23,925 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:38:23,925 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:38:23,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:38:23 BasicIcfg [2025-04-13 19:38:23,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:38:23,928 INFO L158 Benchmark]: Toolchain (without parser) took 22382.95ms. Allocated memory was 155.2MB in the beginning and 666.9MB in the end (delta: 511.7MB). Free memory was 104.2MB in the beginning and 533.5MB in the end (delta: -429.2MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. [2025-04-13 19:38:23,928 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:23,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.71ms. Allocated memory is still 155.2MB. Free memory was 104.2MB in the beginning and 70.0MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 19:38:23,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.36ms. Allocated memory is still 155.2MB. Free memory was 70.0MB in the beginning and 67.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:23,929 INFO L158 Benchmark]: Boogie Preprocessor took 69.86ms. Allocated memory is still 155.2MB. Free memory was 67.4MB in the beginning and 64.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:23,929 INFO L158 Benchmark]: RCFGBuilder took 740.73ms. Allocated memory is still 155.2MB. Free memory was 64.1MB in the beginning and 73.7MB in the end (delta: -9.7MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. [2025-04-13 19:38:23,929 INFO L158 Benchmark]: TraceAbstraction took 20960.32ms. Allocated memory was 155.2MB in the beginning and 666.9MB in the end (delta: 511.7MB). Free memory was 72.9MB in the beginning and 533.5MB in the end (delta: -460.5MB). Peak memory consumption was 50.8MB. Max. memory is 8.0GB. [2025-04-13 19:38:23,930 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 559.71ms. Allocated memory is still 155.2MB. Free memory was 104.2MB in the beginning and 70.0MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.36ms. Allocated memory is still 155.2MB. Free memory was 70.0MB in the beginning and 67.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 69.86ms. Allocated memory is still 155.2MB. Free memory was 67.4MB in the beginning and 64.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 740.73ms. Allocated memory is still 155.2MB. Free memory was 64.1MB in the beginning and 73.7MB in the end (delta: -9.7MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. * TraceAbstraction took 20960.32ms. Allocated memory was 155.2MB in the beginning and 666.9MB in the end (delta: 511.7MB). Free memory was 72.9MB in the beginning and 533.5MB in the end (delta: -460.5MB). Peak memory consumption was 50.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 36 locations, 43 edges, 8 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: 20.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1266 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1266 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5988 IncrementalHoareTripleChecker+Invalid, 6041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 0 mSDtfsCounter, 5988 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 135 SyntacticMatches, 8 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2522occurred in iteration=9, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 438 NumberOfCodeBlocks, 437 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 10239 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1495 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 29 InterpolantComputations, 14 PerfectInterpolantSequences, 43/58 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:38:23,949 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 Received shutdown request...