./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:35:40,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:35:40,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:35:40,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:35:40,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:35:41,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:35:41,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:35:41,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:35:41,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:35:41,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:35:41,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:35:41,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:35:41,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:35:41,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:35:41,007 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:35:41,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:35:41,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:35:41,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:35:41,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:35:41,009 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b [2025-02-06 04:35:41,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:35:41,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:35:41,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:35:41,166 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:35:41,167 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:35:41,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-02-06 04:35:42,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d2566869/bbf34aac58fa4b098323299ee637dad9/FLAGfe7c6f39f [2025-02-06 04:35:42,483 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:35:42,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-02-06 04:35:42,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d2566869/bbf34aac58fa4b098323299ee637dad9/FLAGfe7c6f39f [2025-02-06 04:35:42,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d2566869/bbf34aac58fa4b098323299ee637dad9 [2025-02-06 04:35:42,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:35:42,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:35:42,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:35:42,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:35:42,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:35:42,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:42,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4c42be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42, skipping insertion in model container [2025-02-06 04:35:42,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:42,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:35:42,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c[2556,2569] [2025-02-06 04:35:42,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:35:42,957 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:35:42,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c[2556,2569] [2025-02-06 04:35:42,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:35:42,978 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:35:42,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42 WrapperNode [2025-02-06 04:35:42,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:35:42,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:35:42,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:35:42,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:35:42,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:42,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:42,999 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-02-06 04:35:42,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:35:43,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:35:43,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:35:43,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:35:43,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,014 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:35:43,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:35:43,020 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:35:43,021 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:35:43,021 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:35:43,021 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (1/1) ... [2025-02-06 04:35:43,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:35:43,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:43,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:35:43,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:35:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:35:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:35:43,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:35:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:35:43,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:35:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:35:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:35:43,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:35:43,067 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:35:43,142 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:35:43,143 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:35:43,354 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:35:43,354 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:35:43,432 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:35:43,432 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:35:43,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:35:43 BoogieIcfgContainer [2025-02-06 04:35:43,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:35:43,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:35:43,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:35:43,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:35:43,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:35:42" (1/3) ... [2025-02-06 04:35:43,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1c8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:35:43, skipping insertion in model container [2025-02-06 04:35:43,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:42" (2/3) ... [2025-02-06 04:35:43,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1c8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:35:43, skipping insertion in model container [2025-02-06 04:35:43,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:35:43" (3/3) ... [2025-02-06 04:35:43,447 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2025-02-06 04:35:43,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:35:43,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-2.wvr.c that has 3 procedures, 53 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-06 04:35:43,459 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:35:43,501 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:35:43,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 122 flow [2025-02-06 04:35:43,564 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2025-02-06 04:35:43,567 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:35:43,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 2/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-06 04:35:43,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 54 transitions, 122 flow [2025-02-06 04:35:43,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 114 flow [2025-02-06 04:35:43,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:35:43,587 INFO L333 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;@7e64bed5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:35:43,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:35:43,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:35:43,604 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-02-06 04:35:43,604 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:35:43,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:43,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:43,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:43,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 536100910, now seen corresponding path program 1 times [2025-02-06 04:35:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:43,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414054911] [2025-02-06 04:35:43,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:43,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 04:35:43,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 04:35:43,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:43,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:44,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414054911] [2025-02-06 04:35:44,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414054911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:44,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:44,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:35:44,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792685025] [2025-02-06 04:35:44,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:44,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:35:44,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:44,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:35:44,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:35:44,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 04:35:44,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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-02-06 04:35:44,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:44,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 04:35:44,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:44,457 INFO L124 PetriNetUnfolderBase]: 441/859 cut-off events. [2025-02-06 04:35:44,457 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-06 04:35:44,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 859 events. 441/859 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3815 event pairs, 149 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 1552. Up to 274 conditions per place. [2025-02-06 04:35:44,463 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 70 selfloop transitions, 10 changer transitions 21/110 dead transitions. [2025-02-06 04:35:44,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 110 transitions, 461 flow [2025-02-06 04:35:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:35:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:35:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2025-02-06 04:35:44,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2025-02-06 04:35:44,472 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 114 flow. Second operand 8 states and 190 transitions. [2025-02-06 04:35:44,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 110 transitions, 461 flow [2025-02-06 04:35:44,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:35:44,479 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 150 flow [2025-02-06 04:35:44,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-02-06 04:35:44,483 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2025-02-06 04:35:44,483 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 150 flow [2025-02-06 04:35:44,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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-02-06 04:35:44,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:44,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:44,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:35:44,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:44,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash -802854162, now seen corresponding path program 2 times [2025-02-06 04:35:44,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:44,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952024749] [2025-02-06 04:35:44,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:35:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:44,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-02-06 04:35:44,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 04:35:44,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:44,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952024749] [2025-02-06 04:35:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952024749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:44,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568553680] [2025-02-06 04:35:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:44,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:44,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:44,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:44,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-02-06 04:35:44,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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-02-06 04:35:44,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:44,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-02-06 04:35:44,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:44,828 INFO L124 PetriNetUnfolderBase]: 722/1316 cut-off events. [2025-02-06 04:35:44,829 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-02-06 04:35:44,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1316 events. 722/1316 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6059 event pairs, 120 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 2835. Up to 814 conditions per place. [2025-02-06 04:35:44,835 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 89 selfloop transitions, 18 changer transitions 9/122 dead transitions. [2025-02-06 04:35:44,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 122 transitions, 558 flow [2025-02-06 04:35:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:35:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:35:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2025-02-06 04:35:44,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2025-02-06 04:35:44,837 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 150 flow. Second operand 7 states and 164 transitions. [2025-02-06 04:35:44,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 122 transitions, 558 flow [2025-02-06 04:35:44,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 122 transitions, 556 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:44,841 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 261 flow [2025-02-06 04:35:44,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-02-06 04:35:44,842 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2025-02-06 04:35:44,842 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 261 flow [2025-02-06 04:35:44,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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-02-06 04:35:44,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:44,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:44,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:35:44,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 879340076, now seen corresponding path program 3 times [2025-02-06 04:35:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570612181] [2025-02-06 04:35:44,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:35:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:44,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 1 equivalence classes. [2025-02-06 04:35:44,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 04:35:44,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:35:44,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570612181] [2025-02-06 04:35:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570612181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:44,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:35:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105061986] [2025-02-06 04:35:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:44,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:35:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:44,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:35:44,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:35:44,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 04:35:44,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-06 04:35:44,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:44,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 04:35:44,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:45,068 INFO L124 PetriNetUnfolderBase]: 536/1092 cut-off events. [2025-02-06 04:35:45,068 INFO L125 PetriNetUnfolderBase]: For 503/505 co-relation queries the response was YES. [2025-02-06 04:35:45,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 1092 events. 536/1092 cut-off events. For 503/505 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5396 event pairs, 334 based on Foata normal form. 10/1093 useless extension candidates. Maximal degree in co-relation 1287. Up to 753 conditions per place. [2025-02-06 04:35:45,073 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 64 selfloop transitions, 2 changer transitions 4/83 dead transitions. [2025-02-06 04:35:45,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 453 flow [2025-02-06 04:35:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:35:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:35:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-02-06 04:35:45,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-02-06 04:35:45,074 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 261 flow. Second operand 3 states and 87 transitions. [2025-02-06 04:35:45,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 453 flow [2025-02-06 04:35:45,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 448 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:45,078 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 264 flow [2025-02-06 04:35:45,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-02-06 04:35:45,079 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2025-02-06 04:35:45,079 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 264 flow [2025-02-06 04:35:45,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-06 04:35:45,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:45,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:45,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:35:45,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:45,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1944676580, now seen corresponding path program 4 times [2025-02-06 04:35:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288908028] [2025-02-06 04:35:45,080 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:35:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:45,087 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-06 04:35:45,091 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 47 statements. [2025-02-06 04:35:45,091 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:35:45,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:45,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288908028] [2025-02-06 04:35:45,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288908028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:45,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:35:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869261214] [2025-02-06 04:35:45,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:45,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:35:45,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:45,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:35:45,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:35:45,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 54 [2025-02-06 04:35:45,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-06 04:35:45,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:45,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 54 [2025-02-06 04:35:45,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:45,530 INFO L124 PetriNetUnfolderBase]: 1158/2176 cut-off events. [2025-02-06 04:35:45,530 INFO L125 PetriNetUnfolderBase]: For 1119/1119 co-relation queries the response was YES. [2025-02-06 04:35:45,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5975 conditions, 2176 events. 1158/2176 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11697 event pairs, 108 based on Foata normal form. 0/2148 useless extension candidates. Maximal degree in co-relation 2382. Up to 818 conditions per place. [2025-02-06 04:35:45,542 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 144 selfloop transitions, 45 changer transitions 7/203 dead transitions. [2025-02-06 04:35:45,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 203 transitions, 1169 flow [2025-02-06 04:35:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:35:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:35:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2025-02-06 04:35:45,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2025-02-06 04:35:45,548 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 264 flow. Second operand 10 states and 214 transitions. [2025-02-06 04:35:45,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 203 transitions, 1169 flow [2025-02-06 04:35:45,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 203 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:35:45,555 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 608 flow [2025-02-06 04:35:45,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=608, PETRI_PLACES=85, PETRI_TRANSITIONS=105} [2025-02-06 04:35:45,556 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2025-02-06 04:35:45,556 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 105 transitions, 608 flow [2025-02-06 04:35:45,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-06 04:35:45,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:45,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:45,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:35:45,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:45,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2050864592, now seen corresponding path program 5 times [2025-02-06 04:35:45,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:45,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394428358] [2025-02-06 04:35:45,557 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:35:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:45,567 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-02-06 04:35:45,573 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 04:35:45,573 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:45,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:45,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394428358] [2025-02-06 04:35:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394428358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:45,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:45,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:35:45,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280295697] [2025-02-06 04:35:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:45,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:35:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:45,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:35:45,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:35:45,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 04:35:45,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 105 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-06 04:35:45,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:45,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 04:35:45,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:45,815 INFO L124 PetriNetUnfolderBase]: 862/1735 cut-off events. [2025-02-06 04:35:45,815 INFO L125 PetriNetUnfolderBase]: For 2669/2707 co-relation queries the response was YES. [2025-02-06 04:35:45,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5598 conditions, 1735 events. 862/1735 cut-off events. For 2669/2707 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9483 event pairs, 482 based on Foata normal form. 26/1743 useless extension candidates. Maximal degree in co-relation 3385. Up to 1255 conditions per place. [2025-02-06 04:35:45,825 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 100 selfloop transitions, 2 changer transitions 1/125 dead transitions. [2025-02-06 04:35:45,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 914 flow [2025-02-06 04:35:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:35:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:35:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-06 04:35:45,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-02-06 04:35:45,826 INFO L175 Difference]: Start difference. First operand has 85 places, 105 transitions, 608 flow. Second operand 3 states and 88 transitions. [2025-02-06 04:35:45,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 914 flow [2025-02-06 04:35:45,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 125 transitions, 864 flow, removed 25 selfloop flow, removed 0 redundant places. [2025-02-06 04:35:45,838 INFO L231 Difference]: Finished difference. Result has 88 places, 103 transitions, 558 flow [2025-02-06 04:35:45,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=88, PETRI_TRANSITIONS=103} [2025-02-06 04:35:45,838 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-02-06 04:35:45,839 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 103 transitions, 558 flow [2025-02-06 04:35:45,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-06 04:35:45,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:45,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:45,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:35:45,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:45,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1234153840, now seen corresponding path program 6 times [2025-02-06 04:35:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830768695] [2025-02-06 04:35:45,840 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:35:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:45,847 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 1 equivalence classes. [2025-02-06 04:35:45,853 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 04:35:45,853 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:35:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830768695] [2025-02-06 04:35:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830768695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:35:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835924536] [2025-02-06 04:35:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:35:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:45,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:35:45,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:35:45,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 04:35:45,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 103 transitions, 558 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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-02-06 04:35:45,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:45,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 04:35:45,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:46,290 INFO L124 PetriNetUnfolderBase]: 857/1686 cut-off events. [2025-02-06 04:35:46,291 INFO L125 PetriNetUnfolderBase]: For 2122/2146 co-relation queries the response was YES. [2025-02-06 04:35:46,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5403 conditions, 1686 events. 857/1686 cut-off events. For 2122/2146 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9126 event pairs, 259 based on Foata normal form. 9/1664 useless extension candidates. Maximal degree in co-relation 5112. Up to 556 conditions per place. [2025-02-06 04:35:46,297 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 97 selfloop transitions, 9 changer transitions 63/189 dead transitions. [2025-02-06 04:35:46,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 189 transitions, 1367 flow [2025-02-06 04:35:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:35:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:35:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2025-02-06 04:35:46,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2025-02-06 04:35:46,298 INFO L175 Difference]: Start difference. First operand has 88 places, 103 transitions, 558 flow. Second operand 8 states and 181 transitions. [2025-02-06 04:35:46,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 189 transitions, 1367 flow [2025-02-06 04:35:46,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 189 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:35:46,305 INFO L231 Difference]: Finished difference. Result has 94 places, 97 transitions, 545 flow [2025-02-06 04:35:46,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=545, PETRI_PLACES=94, PETRI_TRANSITIONS=97} [2025-02-06 04:35:46,305 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 38 predicate places. [2025-02-06 04:35:46,306 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 97 transitions, 545 flow [2025-02-06 04:35:46,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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-02-06 04:35:46,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:46,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:35:46,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:46,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1067906654, now seen corresponding path program 7 times [2025-02-06 04:35:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308243048] [2025-02-06 04:35:46,307 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:35:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:46,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 04:35:46,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 04:35:46,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:46,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308243048] [2025-02-06 04:35:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308243048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447429838] [2025-02-06 04:35:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:46,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:46,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:46,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:46,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 04:35:46,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 97 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-02-06 04:35:46,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:46,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 04:35:46,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:46,594 INFO L124 PetriNetUnfolderBase]: 558/1188 cut-off events. [2025-02-06 04:35:46,594 INFO L125 PetriNetUnfolderBase]: For 1430/1438 co-relation queries the response was YES. [2025-02-06 04:35:46,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 1188 events. 558/1188 cut-off events. For 1430/1438 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6104 event pairs, 111 based on Foata normal form. 6/1168 useless extension candidates. Maximal degree in co-relation 3758. Up to 897 conditions per place. [2025-02-06 04:35:46,600 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 78 selfloop transitions, 13 changer transitions 6/117 dead transitions. [2025-02-06 04:35:46,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 117 transitions, 811 flow [2025-02-06 04:35:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-02-06 04:35:46,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-02-06 04:35:46,602 INFO L175 Difference]: Start difference. First operand has 94 places, 97 transitions, 545 flow. Second operand 5 states and 122 transitions. [2025-02-06 04:35:46,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 117 transitions, 811 flow [2025-02-06 04:35:46,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 765 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-02-06 04:35:46,608 INFO L231 Difference]: Finished difference. Result has 88 places, 98 transitions, 545 flow [2025-02-06 04:35:46,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=545, PETRI_PLACES=88, PETRI_TRANSITIONS=98} [2025-02-06 04:35:46,609 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-02-06 04:35:46,609 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 545 flow [2025-02-06 04:35:46,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-02-06 04:35:46,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:46,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:46,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:35:46,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:46,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1078636822, now seen corresponding path program 8 times [2025-02-06 04:35:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:46,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794268580] [2025-02-06 04:35:46,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:35:46,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:46,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-02-06 04:35:46,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 04:35:46,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:46,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:46,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794268580] [2025-02-06 04:35:46,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794268580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:46,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:46,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928192712] [2025-02-06 04:35:46,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:46,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:46,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:46,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:46,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 04:35:46,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 98 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-02-06 04:35:46,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:46,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 04:35:46,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:46,906 INFO L124 PetriNetUnfolderBase]: 518/1110 cut-off events. [2025-02-06 04:35:46,906 INFO L125 PetriNetUnfolderBase]: For 1289/1297 co-relation queries the response was YES. [2025-02-06 04:35:46,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 1110 events. 518/1110 cut-off events. For 1289/1297 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5597 event pairs, 109 based on Foata normal form. 6/1090 useless extension candidates. Maximal degree in co-relation 3171. Up to 809 conditions per place. [2025-02-06 04:35:46,911 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 76 selfloop transitions, 14 changer transitions 6/116 dead transitions. [2025-02-06 04:35:46,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 116 transitions, 781 flow [2025-02-06 04:35:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-02-06 04:35:46,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45925925925925926 [2025-02-06 04:35:46,912 INFO L175 Difference]: Start difference. First operand has 88 places, 98 transitions, 545 flow. Second operand 5 states and 124 transitions. [2025-02-06 04:35:46,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 116 transitions, 781 flow [2025-02-06 04:35:46,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 116 transitions, 762 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 04:35:46,916 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 536 flow [2025-02-06 04:35:46,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=536, PETRI_PLACES=90, PETRI_TRANSITIONS=95} [2025-02-06 04:35:46,917 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 34 predicate places. [2025-02-06 04:35:46,917 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 95 transitions, 536 flow [2025-02-06 04:35:46,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-02-06 04:35:46,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:46,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:46,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:35:46,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:46,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1147917703, now seen corresponding path program 1 times [2025-02-06 04:35:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296561797] [2025-02-06 04:35:46,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:46,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 04:35:46,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 04:35:46,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:46,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:46,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:46,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296561797] [2025-02-06 04:35:46,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296561797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:46,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:46,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:35:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561362680] [2025-02-06 04:35:46,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:46,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:35:46,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:46,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:35:46,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:35:46,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-02-06 04:35:46,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 95 transitions, 536 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-06 04:35:46,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:46,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-02-06 04:35:46,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:47,127 INFO L124 PetriNetUnfolderBase]: 501/1045 cut-off events. [2025-02-06 04:35:47,127 INFO L125 PetriNetUnfolderBase]: For 1215/1229 co-relation queries the response was YES. [2025-02-06 04:35:47,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 1045 events. 501/1045 cut-off events. For 1215/1229 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4892 event pairs, 89 based on Foata normal form. 24/1061 useless extension candidates. Maximal degree in co-relation 2868. Up to 545 conditions per place. [2025-02-06 04:35:47,132 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 86 selfloop transitions, 17 changer transitions 1/113 dead transitions. [2025-02-06 04:35:47,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 784 flow [2025-02-06 04:35:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-02-06 04:35:47,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-02-06 04:35:47,133 INFO L175 Difference]: Start difference. First operand has 90 places, 95 transitions, 536 flow. Second operand 5 states and 116 transitions. [2025-02-06 04:35:47,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 784 flow [2025-02-06 04:35:47,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 113 transitions, 732 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 04:35:47,137 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 506 flow [2025-02-06 04:35:47,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2025-02-06 04:35:47,138 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2025-02-06 04:35:47,138 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 506 flow [2025-02-06 04:35:47,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-06 04:35:47,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:47,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:47,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:35:47,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:47,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:47,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1361046205, now seen corresponding path program 1 times [2025-02-06 04:35:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:47,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619807677] [2025-02-06 04:35:47,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:47,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 04:35:47,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 04:35:47,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:47,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:47,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619807677] [2025-02-06 04:35:47,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619807677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:47,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:47,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:35:47,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426648658] [2025-02-06 04:35:47,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:47,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:35:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:47,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:35:47,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:35:47,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-02-06 04:35:47,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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-02-06 04:35:47,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:47,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-02-06 04:35:47,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:47,446 INFO L124 PetriNetUnfolderBase]: 449/957 cut-off events. [2025-02-06 04:35:47,446 INFO L125 PetriNetUnfolderBase]: For 1314/1328 co-relation queries the response was YES. [2025-02-06 04:35:47,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2939 conditions, 957 events. 449/957 cut-off events. For 1314/1328 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4490 event pairs, 145 based on Foata normal form. 12/958 useless extension candidates. Maximal degree in co-relation 1651. Up to 331 conditions per place. [2025-02-06 04:35:47,450 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 73 selfloop transitions, 16 changer transitions 20/120 dead transitions. [2025-02-06 04:35:47,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 120 transitions, 830 flow [2025-02-06 04:35:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:35:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:35:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-02-06 04:35:47,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-02-06 04:35:47,452 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 506 flow. Second operand 7 states and 147 transitions. [2025-02-06 04:35:47,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 120 transitions, 830 flow [2025-02-06 04:35:47,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 820 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-02-06 04:35:47,456 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 460 flow [2025-02-06 04:35:47,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2025-02-06 04:35:47,457 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 41 predicate places. [2025-02-06 04:35:47,457 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 460 flow [2025-02-06 04:35:47,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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-02-06 04:35:47,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:47,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:47,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:35:47,457 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1612802183, now seen corresponding path program 2 times [2025-02-06 04:35:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230021260] [2025-02-06 04:35:47,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:35:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:47,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-02-06 04:35:47,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 04:35:47,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:47,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:47,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:47,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230021260] [2025-02-06 04:35:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230021260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:47,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:35:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037091963] [2025-02-06 04:35:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:47,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:35:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:47,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:35:47,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:35:47,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-02-06 04:35:47,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-06 04:35:47,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:47,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-02-06 04:35:47,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:47,602 INFO L124 PetriNetUnfolderBase]: 212/469 cut-off events. [2025-02-06 04:35:47,602 INFO L125 PetriNetUnfolderBase]: For 644/648 co-relation queries the response was YES. [2025-02-06 04:35:47,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 469 events. 212/469 cut-off events. For 644/648 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1602 event pairs, 48 based on Foata normal form. 12/477 useless extension candidates. Maximal degree in co-relation 1361. Up to 188 conditions per place. [2025-02-06 04:35:47,605 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 59 selfloop transitions, 7 changer transitions 2/75 dead transitions. [2025-02-06 04:35:47,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 75 transitions, 475 flow [2025-02-06 04:35:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-02-06 04:35:47,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2025-02-06 04:35:47,606 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 460 flow. Second operand 5 states and 104 transitions. [2025-02-06 04:35:47,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 75 transitions, 475 flow [2025-02-06 04:35:47,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 75 transitions, 393 flow, removed 9 selfloop flow, removed 19 redundant places. [2025-02-06 04:35:47,608 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 211 flow [2025-02-06 04:35:47,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2025-02-06 04:35:47,609 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2025-02-06 04:35:47,609 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 211 flow [2025-02-06 04:35:47,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-06 04:35:47,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:47,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:47,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:35:47,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 454587439, now seen corresponding path program 2 times [2025-02-06 04:35:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13356980] [2025-02-06 04:35:47,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:35:47,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:47,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-02-06 04:35:47,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 04:35:47,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13356980] [2025-02-06 04:35:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13356980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:47,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:47,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:35:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536309452] [2025-02-06 04:35:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:47,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:35:47,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:47,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:35:47,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:35:47,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-02-06 04:35:47,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 56 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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-02-06 04:35:47,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:47,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-02-06 04:35:47,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:47,835 INFO L124 PetriNetUnfolderBase]: 106/263 cut-off events. [2025-02-06 04:35:47,836 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-02-06 04:35:47,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 263 events. 106/263 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 862 event pairs, 40 based on Foata normal form. 10/273 useless extension candidates. Maximal degree in co-relation 668. Up to 86 conditions per place. [2025-02-06 04:35:47,836 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-02-06 04:35:47,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 51 transitions, 269 flow [2025-02-06 04:35:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:35:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:35:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-02-06 04:35:47,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2751322751322751 [2025-02-06 04:35:47,837 INFO L175 Difference]: Start difference. First operand has 76 places, 56 transitions, 211 flow. Second operand 7 states and 104 transitions. [2025-02-06 04:35:47,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 51 transitions, 269 flow [2025-02-06 04:35:47,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 242 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 04:35:47,838 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-02-06 04:35:47,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-02-06 04:35:47,839 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-02-06 04:35:47,839 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-02-06 04:35:47,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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-02-06 04:35:47,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-06 04:35:47,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-02-06 04:35:47,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-06 04:35:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:35:47,842 INFO L422 BasicCegarLoop]: Path program histogram: [8, 2, 2] [2025-02-06 04:35:47,844 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:35:47,844 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:35:47,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:35:47 BasicIcfg [2025-02-06 04:35:47,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:35:47,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:35:47,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:35:47,848 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:35:47,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:35:43" (3/4) ... [2025-02-06 04:35:47,850 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 04:35:47,852 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 04:35:47,852 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 04:35:47,854 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 04:35:47,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 04:35:47,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 04:35:47,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 04:35:47,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:35:47,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:35:47,904 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:35:47,905 INFO L158 Benchmark]: Toolchain (without parser) took 5077.87ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 124.5MB in the beginning and 255.9MB in the end (delta: -131.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2025-02-06 04:35:47,905 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:35:47,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.53ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 112.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:35:47,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.20ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:35:47,906 INFO L158 Benchmark]: Boogie Preprocessor took 20.15ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:35:47,906 INFO L158 Benchmark]: IcfgBuilder took 412.37ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 81.4MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:35:47,906 INFO L158 Benchmark]: TraceAbstraction took 4413.44ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 81.4MB in the beginning and 260.5MB in the end (delta: -179.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:35:47,906 INFO L158 Benchmark]: Witness Printer took 56.10ms. Allocated memory is still 335.5MB. Free memory was 260.5MB in the beginning and 255.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:35:47,907 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.16ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.53ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 112.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.20ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.15ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 412.37ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 81.4MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4413.44ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 81.4MB in the beginning and 260.5MB in the end (delta: -179.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.10ms. Allocated memory is still 335.5MB. Free memory was 260.5MB in the beginning and 255.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 98]: 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 5 procedures, 83 locations, 3 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: 4.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2723 IncrementalHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 2 mSDtfsCounter, 2723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=4, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 568 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 04:35:47,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE