./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 551b0097 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-?-551b009-m [2025-01-09 16:40:40,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:40:40,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:40:40,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:40:40,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:40:40,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:40:40,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:40:40,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:40:40,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:40:40,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:40:40,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:40:40,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:40:40,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:40:40,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:40:40,568 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:40:40,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:40:40,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:40:40,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:40:40,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:40:40,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:40:40,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:40:40,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:40,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:40:40,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:40,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:40:40,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:40:40,571 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-01-09 16:40:40,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:40:40,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:40:40,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:40:40,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:40:40,815 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:40:40,817 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-01-09 16:40:41,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82cb61902/7ea2cb31b7264fa88c690a430607e5d7/FLAGb551957ac [2025-01-09 16:40:42,182 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:40:42,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-01-09 16:40:42,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82cb61902/7ea2cb31b7264fa88c690a430607e5d7/FLAGb551957ac [2025-01-09 16:40:42,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82cb61902/7ea2cb31b7264fa88c690a430607e5d7 [2025-01-09 16:40:42,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:40:42,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:40:42,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:40:42,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:40:42,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:40:42,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a00cf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42, skipping insertion in model container [2025-01-09 16:40:42,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:40:42,615 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-01-09 16:40:42,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:40:42,629 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:40:42,650 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-01-09 16:40:42,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:40:42,663 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:40:42,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42 WrapperNode [2025-01-09 16:40:42,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:40:42,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:40:42,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:40:42,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:40:42,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,691 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-01-09 16:40:42,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:40:42,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:40:42,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:40:42,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:40:42,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,715 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-01-09 16:40:42,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:40:42,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:40:42,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:40:42,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:40:42,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (1/1) ... [2025-01-09 16:40:42,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:42,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:42,758 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-01-09 16:40:42,767 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-01-09 16:40:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:40:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:40:42,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:40:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:40:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:40:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:40:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:40:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:40:42,783 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:40:42,857 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:40:42,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:40:43,139 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:40:43,139 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:40:43,263 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:40:43,264 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:40:43,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:43 BoogieIcfgContainer [2025-01-09 16:40:43,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:40:43,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:40:43,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:40:43,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:40:43,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:40:42" (1/3) ... [2025-01-09 16:40:43,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea85ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:43, skipping insertion in model container [2025-01-09 16:40:43,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:42" (2/3) ... [2025-01-09 16:40:43,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea85ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:43, skipping insertion in model container [2025-01-09 16:40:43,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:43" (3/3) ... [2025-01-09 16:40:43,272 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2025-01-09 16:40:43,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:40:43,286 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-01-09 16:40:43,286 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:40:43,335 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:40:43,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 122 flow [2025-01-09 16:40:43,405 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2025-01-09 16:40:43,406 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:40:43,409 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 40 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-01-09 16:40:43,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 54 transitions, 122 flow [2025-01-09 16:40:43,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 114 flow [2025-01-09 16:40:43,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:40:43,439 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;@44dc833d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:40:43,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:40:43,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:40:43,458 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-01-09 16:40:43,458 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:40:43,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:43,459 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-01-09 16:40:43,459 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-01-09 16:40:43,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1040242015, now seen corresponding path program 1 times [2025-01-09 16:40:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:43,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941346692] [2025-01-09 16:40:43,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:43,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 16:40:43,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:40:43,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:43,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941346692] [2025-01-09 16:40:43,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941346692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:43,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:43,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:40:43,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558565079] [2025-01-09 16:40:43,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:43,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:40:43,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:43,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:40:43,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:40:43,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2025-01-09 16:40:43,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 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-01-09 16:40:43,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:43,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2025-01-09 16:40:43,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:44,153 INFO L124 PetriNetUnfolderBase]: 168/427 cut-off events. [2025-01-09 16:40:44,153 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 16:40:44,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 427 events. 168/427 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1950 event pairs, 56 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 684. Up to 98 conditions per place. [2025-01-09 16:40:44,157 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 51 selfloop transitions, 10 changer transitions 12/94 dead transitions. [2025-01-09 16:40:44,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 373 flow [2025-01-09 16:40:44,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:40:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:40:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2025-01-09 16:40:44,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-01-09 16:40:44,166 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 114 flow. Second operand 8 states and 258 transitions. [2025-01-09 16:40:44,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 373 flow [2025-01-09 16:40:44,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 347 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:40:44,172 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 150 flow [2025-01-09 16:40:44,174 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-01-09 16:40:44,177 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2025-01-09 16:40:44,177 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 150 flow [2025-01-09 16:40:44,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 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-01-09 16:40:44,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:44,179 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-01-09 16:40:44,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:40:44,179 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-01-09 16:40:44,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash 413092827, now seen corresponding path program 2 times [2025-01-09 16:40:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532274346] [2025-01-09 16:40:44,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:44,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-01-09 16:40:44,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:40:44,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:44,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:44,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:44,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532274346] [2025-01-09 16:40:44,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532274346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:44,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:44,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21512649] [2025-01-09 16:40:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:44,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:44,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-09 16:40:44,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-01-09 16:40:44,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:44,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-09 16:40:44,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:44,484 INFO L124 PetriNetUnfolderBase]: 330/757 cut-off events. [2025-01-09 16:40:44,484 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 16:40:44,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 757 events. 330/757 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3881 event pairs, 46 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 1469. Up to 418 conditions per place. [2025-01-09 16:40:44,488 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 50 selfloop transitions, 18 changer transitions 6/98 dead transitions. [2025-01-09 16:40:44,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 385 flow [2025-01-09 16:40:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:40:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:40:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2025-01-09 16:40:44,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58994708994709 [2025-01-09 16:40:44,490 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 150 flow. Second operand 7 states and 223 transitions. [2025-01-09 16:40:44,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 385 flow [2025-01-09 16:40:44,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 383 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:44,493 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 261 flow [2025-01-09 16:40:44,493 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-01-09 16:40:44,493 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2025-01-09 16:40:44,493 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 261 flow [2025-01-09 16:40:44,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-01-09 16:40:44,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:44,494 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-01-09 16:40:44,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:40:44,494 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-01-09 16:40:44,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2069709107, now seen corresponding path program 3 times [2025-01-09 16:40:44,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:44,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033677231] [2025-01-09 16:40:44,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:44,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 1 equivalence classes. [2025-01-09 16:40:44,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:40:44,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:44,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033677231] [2025-01-09 16:40:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033677231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:44,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:44,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:40:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658991846] [2025-01-09 16:40:44,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:44,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:40:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:44,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:40:44,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:40:44,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2025-01-09 16:40:44,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-09 16:40:44,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:44,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2025-01-09 16:40:44,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:44,646 INFO L124 PetriNetUnfolderBase]: 209/577 cut-off events. [2025-01-09 16:40:44,646 INFO L125 PetriNetUnfolderBase]: For 235/238 co-relation queries the response was YES. [2025-01-09 16:40:44,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 577 events. 209/577 cut-off events. For 235/238 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3048 event pairs, 101 based on Foata normal form. 8/553 useless extension candidates. Maximal degree in co-relation 833. Up to 250 conditions per place. [2025-01-09 16:40:44,650 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 33 selfloop transitions, 2 changer transitions 1/76 dead transitions. [2025-01-09 16:40:44,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 354 flow [2025-01-09 16:40:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:40:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:40:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-01-09 16:40:44,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2025-01-09 16:40:44,652 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 261 flow. Second operand 3 states and 113 transitions. [2025-01-09 16:40:44,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 354 flow [2025-01-09 16:40:44,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 349 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:44,655 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 264 flow [2025-01-09 16:40:44,655 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-01-09 16:40:44,656 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2025-01-09 16:40:44,656 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 264 flow [2025-01-09 16:40:44,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-09 16:40:44,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:44,656 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-01-09 16:40:44,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:40:44,656 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-01-09 16:40:44,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1619785449, now seen corresponding path program 4 times [2025-01-09 16:40:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:44,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833940339] [2025-01-09 16:40:44,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:44,663 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-01-09 16:40:44,672 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:40:44,672 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:40:44,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833940339] [2025-01-09 16:40:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833940339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87102587] [2025-01-09 16:40:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:44,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:44,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:44,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:44,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2025-01-09 16:40:44,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-01-09 16:40:44,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:44,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2025-01-09 16:40:44,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:44,968 INFO L124 PetriNetUnfolderBase]: 286/734 cut-off events. [2025-01-09 16:40:44,970 INFO L125 PetriNetUnfolderBase]: For 477/493 co-relation queries the response was YES. [2025-01-09 16:40:44,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 734 events. 286/734 cut-off events. For 477/493 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3933 event pairs, 61 based on Foata normal form. 6/702 useless extension candidates. Maximal degree in co-relation 909. Up to 391 conditions per place. [2025-01-09 16:40:44,974 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 41 selfloop transitions, 14 changer transitions 4/90 dead transitions. [2025-01-09 16:40:44,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 442 flow [2025-01-09 16:40:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-01-09 16:40:44,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-01-09 16:40:44,978 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 264 flow. Second operand 5 states and 176 transitions. [2025-01-09 16:40:44,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 442 flow [2025-01-09 16:40:44,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:44,981 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 326 flow [2025-01-09 16:40:44,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2025-01-09 16:40:44,982 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2025-01-09 16:40:44,982 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 326 flow [2025-01-09 16:40:44,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-01-09 16:40:44,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:44,982 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-01-09 16:40:44,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:40:44,983 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-01-09 16:40:44,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash -235733003, now seen corresponding path program 5 times [2025-01-09 16:40:44,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:44,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39313722] [2025-01-09 16:40:44,983 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:44,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:44,993 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-01-09 16:40:45,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:40:45,003 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:45,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39313722] [2025-01-09 16:40:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39313722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:45,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:40:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579439909] [2025-01-09 16:40:45,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:45,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:40:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:45,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:40:45,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:40:45,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2025-01-09 16:40:45,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 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-01-09 16:40:45,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:45,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2025-01-09 16:40:45,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:45,389 INFO L124 PetriNetUnfolderBase]: 316/741 cut-off events. [2025-01-09 16:40:45,389 INFO L125 PetriNetUnfolderBase]: For 837/852 co-relation queries the response was YES. [2025-01-09 16:40:45,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 741 events. 316/741 cut-off events. For 837/852 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3872 event pairs, 93 based on Foata normal form. 3/702 useless extension candidates. Maximal degree in co-relation 954. Up to 202 conditions per place. [2025-01-09 16:40:45,395 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 48 selfloop transitions, 11 changer transitions 13/105 dead transitions. [2025-01-09 16:40:45,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 105 transitions, 584 flow [2025-01-09 16:40:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:40:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:40:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2025-01-09 16:40:45,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5787037037037037 [2025-01-09 16:40:45,396 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 326 flow. Second operand 8 states and 250 transitions. [2025-01-09 16:40:45,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 105 transitions, 584 flow [2025-01-09 16:40:45,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 570 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:45,402 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 339 flow [2025-01-09 16:40:45,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=339, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2025-01-09 16:40:45,403 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 27 predicate places. [2025-01-09 16:40:45,405 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 339 flow [2025-01-09 16:40:45,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 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-01-09 16:40:45,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:45,406 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-01-09 16:40:45,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:40:45,406 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-01-09 16:40:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1602560563, now seen corresponding path program 6 times [2025-01-09 16:40:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521242678] [2025-01-09 16:40:45,407 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:40:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:45,415 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 1 equivalence classes. [2025-01-09 16:40:45,421 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:40:45,423 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:40:45,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521242678] [2025-01-09 16:40:45,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521242678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:45,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268265742] [2025-01-09 16:40:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:45,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:45,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:45,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:45,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-09 16:40:45,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 339 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-01-09 16:40:45,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:45,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-09 16:40:45,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:45,865 INFO L124 PetriNetUnfolderBase]: 343/848 cut-off events. [2025-01-09 16:40:45,865 INFO L125 PetriNetUnfolderBase]: For 835/909 co-relation queries the response was YES. [2025-01-09 16:40:45,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 848 events. 343/848 cut-off events. For 835/909 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4592 event pairs, 51 based on Foata normal form. 20/818 useless extension candidates. Maximal degree in co-relation 2344. Up to 446 conditions per place. [2025-01-09 16:40:45,870 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 52 selfloop transitions, 20 changer transitions 5/104 dead transitions. [2025-01-09 16:40:45,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 104 transitions, 588 flow [2025-01-09 16:40:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:40:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:40:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2025-01-09 16:40:45,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-01-09 16:40:45,871 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 339 flow. Second operand 7 states and 222 transitions. [2025-01-09 16:40:45,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 104 transitions, 588 flow [2025-01-09 16:40:45,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 569 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-09 16:40:45,875 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 404 flow [2025-01-09 16:40:45,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2025-01-09 16:40:45,876 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2025-01-09 16:40:45,876 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 404 flow [2025-01-09 16:40:45,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-01-09 16:40:45,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:45,877 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-01-09 16:40:45,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:40:45,877 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-01-09 16:40:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1691727339, now seen corresponding path program 7 times [2025-01-09 16:40:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457874821] [2025-01-09 16:40:45,877 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:40:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:45,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 16:40:45,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:40:45,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:45,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457874821] [2025-01-09 16:40:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457874821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:40:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023837024] [2025-01-09 16:40:45,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:40:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:45,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:40:45,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:40:45,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2025-01-09 16:40:45,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-09 16:40:45,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:45,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2025-01-09 16:40:45,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:46,032 INFO L124 PetriNetUnfolderBase]: 226/676 cut-off events. [2025-01-09 16:40:46,032 INFO L125 PetriNetUnfolderBase]: For 635/672 co-relation queries the response was YES. [2025-01-09 16:40:46,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 676 events. 226/676 cut-off events. For 635/672 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3924 event pairs, 119 based on Foata normal form. 17/655 useless extension candidates. Maximal degree in co-relation 1126. Up to 264 conditions per place. [2025-01-09 16:40:46,036 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 36 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-01-09 16:40:46,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 503 flow [2025-01-09 16:40:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:40:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:40:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-01-09 16:40:46,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2025-01-09 16:40:46,037 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 404 flow. Second operand 3 states and 114 transitions. [2025-01-09 16:40:46,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 503 flow [2025-01-09 16:40:46,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 485 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:46,041 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 394 flow [2025-01-09 16:40:46,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2025-01-09 16:40:46,042 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2025-01-09 16:40:46,042 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 394 flow [2025-01-09 16:40:46,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-01-09 16:40:46,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:46,042 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-01-09 16:40:46,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:40:46,043 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-01-09 16:40:46,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:46,043 INFO L85 PathProgramCache]: Analyzing trace with hash -573180601, now seen corresponding path program 8 times [2025-01-09 16:40:46,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449046519] [2025-01-09 16:40:46,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:46,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-01-09 16:40:46,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:40:46,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:46,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:46,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:46,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449046519] [2025-01-09 16:40:46,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449046519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:46,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:46,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:46,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466118927] [2025-01-09 16:40:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:46,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:46,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:46,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:46,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2025-01-09 16:40:46,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-01-09 16:40:46,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:46,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2025-01-09 16:40:46,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:46,306 INFO L124 PetriNetUnfolderBase]: 233/646 cut-off events. [2025-01-09 16:40:46,306 INFO L125 PetriNetUnfolderBase]: For 781/797 co-relation queries the response was YES. [2025-01-09 16:40:46,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 646 events. 233/646 cut-off events. For 781/797 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3443 event pairs, 54 based on Foata normal form. 6/620 useless extension candidates. Maximal degree in co-relation 1193. Up to 383 conditions per place. [2025-01-09 16:40:46,310 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 35 selfloop transitions, 12 changer transitions 4/85 dead transitions. [2025-01-09 16:40:46,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 503 flow [2025-01-09 16:40:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2025-01-09 16:40:46,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185185185185185 [2025-01-09 16:40:46,311 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 394 flow. Second operand 5 states and 167 transitions. [2025-01-09 16:40:46,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 503 flow [2025-01-09 16:40:46,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 487 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:40:46,314 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 367 flow [2025-01-09 16:40:46,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2025-01-09 16:40:46,315 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-01-09 16:40:46,315 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 367 flow [2025-01-09 16:40:46,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-01-09 16:40:46,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:46,315 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-01-09 16:40:46,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:40:46,315 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-01-09 16:40:46,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1542120109, now seen corresponding path program 1 times [2025-01-09 16:40:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258786930] [2025-01-09 16:40:46,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:46,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:40:46,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:40:46,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:46,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258786930] [2025-01-09 16:40:46,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258786930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:46,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:46,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:46,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598641482] [2025-01-09 16:40:46,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:46,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:46,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:46,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:46,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:46,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-09 16:40:46,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-09 16:40:46,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:46,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-09 16:40:46,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:46,501 INFO L124 PetriNetUnfolderBase]: 245/638 cut-off events. [2025-01-09 16:40:46,502 INFO L125 PetriNetUnfolderBase]: For 824/848 co-relation queries the response was YES. [2025-01-09 16:40:46,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 638 events. 245/638 cut-off events. For 824/848 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3179 event pairs, 54 based on Foata normal form. 10/628 useless extension candidates. Maximal degree in co-relation 1288. Up to 298 conditions per place. [2025-01-09 16:40:46,504 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 44 selfloop transitions, 13 changer transitions 1/84 dead transitions. [2025-01-09 16:40:46,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 84 transitions, 508 flow [2025-01-09 16:40:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-01-09 16:40:46,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-01-09 16:40:46,505 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 367 flow. Second operand 5 states and 160 transitions. [2025-01-09 16:40:46,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 84 transitions, 508 flow [2025-01-09 16:40:46,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 84 transitions, 464 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-01-09 16:40:46,508 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 355 flow [2025-01-09 16:40:46,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2025-01-09 16:40:46,509 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2025-01-09 16:40:46,509 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 355 flow [2025-01-09 16:40:46,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-09 16:40:46,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:46,509 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-01-09 16:40:46,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:40:46,509 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-01-09 16:40:46,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2091777371, now seen corresponding path program 2 times [2025-01-09 16:40:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355521384] [2025-01-09 16:40:46,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:46,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:40:46,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:40:46,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:46,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:46,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355521384] [2025-01-09 16:40:46,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355521384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:46,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:46,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:40:46,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611194351] [2025-01-09 16:40:46,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:46,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:40:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:46,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:40:46,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:40:46,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-09 16:40:46,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 355 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:46,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:46,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-09 16:40:46,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:46,773 INFO L124 PetriNetUnfolderBase]: 257/666 cut-off events. [2025-01-09 16:40:46,774 INFO L125 PetriNetUnfolderBase]: For 1176/1200 co-relation queries the response was YES. [2025-01-09 16:40:46,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 666 events. 257/666 cut-off events. For 1176/1200 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3378 event pairs, 89 based on Foata normal form. 6/653 useless extension candidates. Maximal degree in co-relation 1458. Up to 266 conditions per place. [2025-01-09 16:40:46,777 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 41 selfloop transitions, 7 changer transitions 22/96 dead transitions. [2025-01-09 16:40:46,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 96 transitions, 617 flow [2025-01-09 16:40:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:40:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:40:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2025-01-09 16:40:46,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5502645502645502 [2025-01-09 16:40:46,778 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 355 flow. Second operand 7 states and 208 transitions. [2025-01-09 16:40:46,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 96 transitions, 617 flow [2025-01-09 16:40:46,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 611 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 16:40:46,782 INFO L231 Difference]: Finished difference. Result has 93 places, 66 transitions, 336 flow [2025-01-09 16:40:46,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=93, PETRI_TRANSITIONS=66} [2025-01-09 16:40:46,784 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2025-01-09 16:40:46,784 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 66 transitions, 336 flow [2025-01-09 16:40:46,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:46,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:46,784 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-01-09 16:40:46,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:40:46,785 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-01-09 16:40:46,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2055796129, now seen corresponding path program 1 times [2025-01-09 16:40:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641395356] [2025-01-09 16:40:46,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:40:46,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:40:46,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:46,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641395356] [2025-01-09 16:40:46,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641395356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:46,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:46,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:46,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626209966] [2025-01-09 16:40:46,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:46,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:40:46,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:46,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:40:46,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:40:46,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-09 16:40:46,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 66 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-09 16:40:46,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:46,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-09 16:40:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:46,932 INFO L124 PetriNetUnfolderBase]: 132/366 cut-off events. [2025-01-09 16:40:46,932 INFO L125 PetriNetUnfolderBase]: For 745/769 co-relation queries the response was YES. [2025-01-09 16:40:46,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 366 events. 132/366 cut-off events. For 745/769 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1435 event pairs, 31 based on Foata normal form. 8/363 useless extension candidates. Maximal degree in co-relation 1121. Up to 194 conditions per place. [2025-01-09 16:40:46,933 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 30 selfloop transitions, 6 changer transitions 11/69 dead transitions. [2025-01-09 16:40:46,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 69 transitions, 408 flow [2025-01-09 16:40:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2025-01-09 16:40:46,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5592592592592592 [2025-01-09 16:40:46,934 INFO L175 Difference]: Start difference. First operand has 93 places, 66 transitions, 336 flow. Second operand 5 states and 151 transitions. [2025-01-09 16:40:46,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 69 transitions, 408 flow [2025-01-09 16:40:46,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 350 flow, removed 7 selfloop flow, removed 13 redundant places. [2025-01-09 16:40:46,936 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 214 flow [2025-01-09 16:40:46,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=210, 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=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2025-01-09 16:40:46,937 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places. [2025-01-09 16:40:46,937 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 214 flow [2025-01-09 16:40:46,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-09 16:40:46,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:46,937 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-01-09 16:40:46,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:40:46,938 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-01-09 16:40:46,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1472327353, now seen corresponding path program 2 times [2025-01-09 16:40:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663267746] [2025-01-09 16:40:46,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:46,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:40:46,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:40:46,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:46,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:47,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:47,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663267746] [2025-01-09 16:40:47,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663267746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:47,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:47,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:40:47,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916243423] [2025-01-09 16:40:47,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:47,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:40:47,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:47,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:40:47,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:40:47,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2025-01-09 16:40:47,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:47,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:47,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2025-01-09 16:40:47,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:47,101 INFO L124 PetriNetUnfolderBase]: 42/149 cut-off events. [2025-01-09 16:40:47,102 INFO L125 PetriNetUnfolderBase]: For 121/123 co-relation queries the response was YES. [2025-01-09 16:40:47,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 149 events. 42/149 cut-off events. For 121/123 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 403 event pairs, 17 based on Foata normal form. 8/155 useless extension candidates. Maximal degree in co-relation 392. Up to 59 conditions per place. [2025-01-09 16:40:47,102 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2025-01-09 16:40:47,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 49 transitions, 255 flow [2025-01-09 16:40:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:40:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:40:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2025-01-09 16:40:47,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47883597883597884 [2025-01-09 16:40:47,103 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 214 flow. Second operand 7 states and 181 transitions. [2025-01-09 16:40:47,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 49 transitions, 255 flow [2025-01-09 16:40:47,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 213 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-01-09 16:40:47,104 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-01-09 16:40:47,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-01-09 16:40:47,105 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-01-09 16:40:47,105 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-01-09 16:40:47,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-01-09 16:40:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-09 16:40:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-09 16:40:47,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:40:47,107 INFO L422 BasicCegarLoop]: Path program histogram: [8, 2, 2] [2025-01-09 16:40:47,109 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:40:47,109 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:40:47,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:40:47 BasicIcfg [2025-01-09 16:40:47,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:40:47,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:40:47,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:40:47,113 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:40:47,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:43" (3/4) ... [2025-01-09 16:40:47,115 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:40:47,117 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 16:40:47,117 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 16:40:47,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2025-01-09 16:40:47,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 16:40:47,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 16:40:47,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 16:40:47,218 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:40:47,218 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:40:47,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:40:47,219 INFO L158 Benchmark]: Toolchain (without parser) took 4718.35ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.4MB in the beginning and 177.0MB in the end (delta: -66.5MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2025-01-09 16:40:47,219 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:40:47,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.62ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:40:47,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.58ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:40:47,219 INFO L158 Benchmark]: Boogie Preprocessor took 38.03ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:40:47,220 INFO L158 Benchmark]: RCFGBuilder took 533.42ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 70.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:40:47,220 INFO L158 Benchmark]: TraceAbstraction took 3846.64ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 69.6MB in the beginning and 185.3MB in the end (delta: -115.7MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2025-01-09 16:40:47,220 INFO L158 Benchmark]: Witness Printer took 105.32ms. Allocated memory is still 285.2MB. Free memory was 185.3MB in the beginning and 177.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:40:47,221 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.22ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.62ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.58ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.03ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 533.42ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 70.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3846.64ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 69.6MB in the beginning and 185.3MB in the end (delta: -115.7MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 105.32ms. Allocated memory is still 285.2MB. Free memory was 185.3MB in the beginning and 177.0MB in the end (delta: 8.3MB). 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: 3.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1815 IncrementalHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 48 mSDtfsCounter, 1815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=6, InterpolantAutomatonStates: 70, 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.3s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1254 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-01-09 16:40:47,236 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