./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe013_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/pthread-wmm/safe013_tso.i -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 0cdeed82108b12e5d5525e3abe542fd48b9a422ac7475147d5db7c8538ce4dc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:04:30,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:04:30,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:04:30,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:04:30,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:04:30,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:04:30,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:04:30,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:04:30,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:04:30,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:04:30,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:04:30,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:04:30,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:04:30,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:04:30,124 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:04:30,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:04:30,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:04:30,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:04:30,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:04:30,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:04:30,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:04:30,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:04:30,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:04:30,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:04:30,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:04:30,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:04:30,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:04:30,127 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 -> 0cdeed82108b12e5d5525e3abe542fd48b9a422ac7475147d5db7c8538ce4dc0 [2025-02-08 01:04:30,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:04:30,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:04:30,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:04:30,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:04:30,381 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:04:30,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe013_tso.i [2025-02-08 01:04:31,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/978ecd01f/a9e8bfca1456420cba4adeeb6f6b0d77/FLAG365c3108b [2025-02-08 01:04:31,893 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:04:31,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe013_tso.i [2025-02-08 01:04:31,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/978ecd01f/a9e8bfca1456420cba4adeeb6f6b0d77/FLAG365c3108b [2025-02-08 01:04:32,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/978ecd01f/a9e8bfca1456420cba4adeeb6f6b0d77 [2025-02-08 01:04:32,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:04:32,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:04:32,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:04:32,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:04:32,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:04:32,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de803e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32, skipping insertion in model container [2025-02-08 01:04:32,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:04:32,336 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/pthread-wmm/safe013_tso.i[945,958] [2025-02-08 01:04:32,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:04:32,478 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:04:32,485 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/pthread-wmm/safe013_tso.i[945,958] [2025-02-08 01:04:32,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:04:32,541 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:04:32,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32 WrapperNode [2025-02-08 01:04:32,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:04:32,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:04:32,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:04:32,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:04:32,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,578 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-02-08 01:04:32,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:04:32,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:04:32,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:04:32,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:04:32,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,608 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:04:32,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:04:32,625 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:04:32,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:04:32,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:04:32,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (1/1) ... [2025-02-08 01:04:32,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:04:32,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:04:32,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:04:32,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:04:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:04:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:04:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 01:04:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 01:04:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 01:04:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 01:04:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 01:04:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 01:04:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:04:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:04:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:04:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:04:32,688 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:04:32,799 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:04:32,800 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:04:32,962 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:04:32,964 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:04:33,036 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:04:33,037 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:04:33,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:04:33 BoogieIcfgContainer [2025-02-08 01:04:33,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:04:33,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:04:33,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:04:33,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:04:33,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:04:32" (1/3) ... [2025-02-08 01:04:33,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f707c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:04:33, skipping insertion in model container [2025-02-08 01:04:33,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:04:32" (2/3) ... [2025-02-08 01:04:33,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f707c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:04:33, skipping insertion in model container [2025-02-08 01:04:33,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:04:33" (3/3) ... [2025-02-08 01:04:33,050 INFO L128 eAbstractionObserver]: Analyzing ICFG safe013_tso.i [2025-02-08 01:04:33,060 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:04:33,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe013_tso.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:04:33,061 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:04:33,101 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:04:33,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-02-08 01:04:33,150 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-02-08 01:04:33,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:04:33,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-02-08 01:04:33,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-02-08 01:04:33,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2025-02-08 01:04:33,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:04:33,174 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;@3ab1ac4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:04:33,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:04:33,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:04:33,181 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-02-08 01:04:33,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:04:33,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:33,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:33,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:33,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1730183841, now seen corresponding path program 1 times [2025-02-08 01:04:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:33,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395790164] [2025-02-08 01:04:33,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:33,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:33,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:04:33,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:04:33,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:33,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:33,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395790164] [2025-02-08 01:04:33,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395790164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:33,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:33,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:04:33,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025932985] [2025-02-08 01:04:33,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:33,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:04:33,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:33,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:04:33,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:04:33,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:04:33,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:33,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:33,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:04:33,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:34,760 INFO L124 PetriNetUnfolderBase]: 9158/13425 cut-off events. [2025-02-08 01:04:34,761 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-08 01:04:34,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26729 conditions, 13425 events. 9158/13425 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 80080 event pairs, 2722 based on Foata normal form. 396/13819 useless extension candidates. Maximal degree in co-relation 26718. Up to 6347 conditions per place. [2025-02-08 01:04:34,843 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 49 selfloop transitions, 5 changer transitions 65/123 dead transitions. [2025-02-08 01:04:34,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 123 transitions, 499 flow [2025-02-08 01:04:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:04:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:04:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2025-02-08 01:04:34,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227106227106227 [2025-02-08 01:04:34,855 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 7 states and 170 transitions. [2025-02-08 01:04:34,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 123 transitions, 499 flow [2025-02-08 01:04:34,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 123 transitions, 494 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:04:34,862 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 121 flow [2025-02-08 01:04:34,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-02-08 01:04:34,866 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2025-02-08 01:04:34,867 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 121 flow [2025-02-08 01:04:34,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:34,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:34,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:04:34,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 164271392, now seen corresponding path program 1 times [2025-02-08 01:04:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:34,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721843662] [2025-02-08 01:04:34,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:34,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:04:34,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:04:34,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:34,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721843662] [2025-02-08 01:04:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721843662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:35,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:35,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:04:35,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928161700] [2025-02-08 01:04:35,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:35,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:35,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:35,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:35,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:04:35,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:35,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:35,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:04:35,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:36,176 INFO L124 PetriNetUnfolderBase]: 8376/12336 cut-off events. [2025-02-08 01:04:36,176 INFO L125 PetriNetUnfolderBase]: For 6248/6263 co-relation queries the response was YES. [2025-02-08 01:04:36,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30092 conditions, 12336 events. 8376/12336 cut-off events. For 6248/6263 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 71360 event pairs, 900 based on Foata normal form. 312/12642 useless extension candidates. Maximal degree in co-relation 30077. Up to 5249 conditions per place. [2025-02-08 01:04:36,220 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 59 selfloop transitions, 6 changer transitions 80/149 dead transitions. [2025-02-08 01:04:36,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 149 transitions, 716 flow [2025-02-08 01:04:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:04:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:04:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2025-02-08 01:04:36,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564102564102564 [2025-02-08 01:04:36,222 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 121 flow. Second operand 10 states and 217 transitions. [2025-02-08 01:04:36,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 149 transitions, 716 flow [2025-02-08 01:04:36,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 149 transitions, 692 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-08 01:04:36,299 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 150 flow [2025-02-08 01:04:36,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=150, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2025-02-08 01:04:36,299 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-02-08 01:04:36,299 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 150 flow [2025-02-08 01:04:36,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:36,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:36,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:36,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:04:36,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:36,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash 548456128, now seen corresponding path program 1 times [2025-02-08 01:04:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737247374] [2025-02-08 01:04:36,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:36,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:36,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:04:36,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:04:36,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:36,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737247374] [2025-02-08 01:04:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737247374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:36,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:04:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663394058] [2025-02-08 01:04:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:36,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:36,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:36,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:36,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:04:36,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:36,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:36,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:04:36,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:37,295 INFO L124 PetriNetUnfolderBase]: 8305/12248 cut-off events. [2025-02-08 01:04:37,296 INFO L125 PetriNetUnfolderBase]: For 16722/16722 co-relation queries the response was YES. [2025-02-08 01:04:37,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33072 conditions, 12248 events. 8305/12248 cut-off events. For 16722/16722 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 72077 event pairs, 679 based on Foata normal form. 354/12600 useless extension candidates. Maximal degree in co-relation 33050. Up to 5749 conditions per place. [2025-02-08 01:04:37,361 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 58 selfloop transitions, 7 changer transitions 74/143 dead transitions. [2025-02-08 01:04:37,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 143 transitions, 757 flow [2025-02-08 01:04:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:04:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:04:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2025-02-08 01:04:37,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541025641025641 [2025-02-08 01:04:37,363 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 150 flow. Second operand 10 states and 211 transitions. [2025-02-08 01:04:37,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 143 transitions, 757 flow [2025-02-08 01:04:37,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 143 transitions, 691 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-02-08 01:04:37,493 INFO L231 Difference]: Finished difference. Result has 63 places, 38 transitions, 165 flow [2025-02-08 01:04:37,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=165, PETRI_PLACES=63, PETRI_TRANSITIONS=38} [2025-02-08 01:04:37,493 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-02-08 01:04:37,493 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 38 transitions, 165 flow [2025-02-08 01:04:37,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:37,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:37,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:37,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:04:37,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:37,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash 53801537, now seen corresponding path program 1 times [2025-02-08 01:04:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533883950] [2025-02-08 01:04:37,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:37,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:04:37,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:04:37,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:37,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533883950] [2025-02-08 01:04:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533883950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:04:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221491829] [2025-02-08 01:04:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:37,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:37,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:37,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:37,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:04:37,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 38 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:37,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:37,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:04:37,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:38,691 INFO L124 PetriNetUnfolderBase]: 8602/12621 cut-off events. [2025-02-08 01:04:38,691 INFO L125 PetriNetUnfolderBase]: For 19128/19128 co-relation queries the response was YES. [2025-02-08 01:04:38,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34809 conditions, 12621 events. 8602/12621 cut-off events. For 19128/19128 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 74289 event pairs, 1103 based on Foata normal form. 300/12920 useless extension candidates. Maximal degree in co-relation 34786. Up to 4096 conditions per place. [2025-02-08 01:04:38,754 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 84 selfloop transitions, 18 changer transitions 94/200 dead transitions. [2025-02-08 01:04:38,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 200 transitions, 1176 flow [2025-02-08 01:04:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 01:04:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 01:04:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 278 transitions. [2025-02-08 01:04:38,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483234714003945 [2025-02-08 01:04:38,756 INFO L175 Difference]: Start difference. First operand has 63 places, 38 transitions, 165 flow. Second operand 13 states and 278 transitions. [2025-02-08 01:04:38,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 200 transitions, 1176 flow [2025-02-08 01:04:38,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 200 transitions, 1048 flow, removed 41 selfloop flow, removed 8 redundant places. [2025-02-08 01:04:38,869 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 349 flow [2025-02-08 01:04:38,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=349, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2025-02-08 01:04:38,870 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2025-02-08 01:04:38,870 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 349 flow [2025-02-08 01:04:38,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:38,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:38,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:38,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:04:38,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:38,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 310187111, now seen corresponding path program 2 times [2025-02-08 01:04:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159685080] [2025-02-08 01:04:38,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:04:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:38,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:04:38,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:04:38,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:04:38,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:39,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:39,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159685080] [2025-02-08 01:04:39,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159685080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:39,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:39,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:04:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746633360] [2025-02-08 01:04:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:39,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:04:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:39,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:04:39,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:04:39,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:04:39,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:39,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:39,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:04:39,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:40,263 INFO L124 PetriNetUnfolderBase]: 10566/15430 cut-off events. [2025-02-08 01:04:40,264 INFO L125 PetriNetUnfolderBase]: For 47481/47499 co-relation queries the response was YES. [2025-02-08 01:04:40,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47915 conditions, 15430 events. 10566/15430 cut-off events. For 47481/47499 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 90840 event pairs, 1972 based on Foata normal form. 326/15753 useless extension candidates. Maximal degree in co-relation 47885. Up to 5012 conditions per place. [2025-02-08 01:04:40,336 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 66 selfloop transitions, 9 changer transitions 78/157 dead transitions. [2025-02-08 01:04:40,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 157 transitions, 1164 flow [2025-02-08 01:04:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:04:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:04:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2025-02-08 01:04:40,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5584045584045584 [2025-02-08 01:04:40,349 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 349 flow. Second operand 9 states and 196 transitions. [2025-02-08 01:04:40,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 157 transitions, 1164 flow [2025-02-08 01:04:40,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 157 transitions, 1050 flow, removed 57 selfloop flow, removed 6 redundant places. [2025-02-08 01:04:40,608 INFO L231 Difference]: Finished difference. Result has 73 places, 40 transitions, 239 flow [2025-02-08 01:04:40,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=73, PETRI_TRANSITIONS=40} [2025-02-08 01:04:40,610 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2025-02-08 01:04:40,611 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 40 transitions, 239 flow [2025-02-08 01:04:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:40,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:40,612 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] [2025-02-08 01:04:40,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:04:40,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 680206185, now seen corresponding path program 1 times [2025-02-08 01:04:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163521603] [2025-02-08 01:04:40,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:40,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:04:40,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:04:40,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:40,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163521603] [2025-02-08 01:04:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163521603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:40,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:40,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:04:40,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554563664] [2025-02-08 01:04:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:40,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:04:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:40,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:04:40,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:04:40,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-08 01:04:40,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 40 transitions, 239 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:40,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:40,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-08 01:04:40,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:40,975 INFO L124 PetriNetUnfolderBase]: 3711/5929 cut-off events. [2025-02-08 01:04:40,975 INFO L125 PetriNetUnfolderBase]: For 12796/12797 co-relation queries the response was YES. [2025-02-08 01:04:40,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 5929 events. 3711/5929 cut-off events. For 12796/12797 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 34152 event pairs, 615 based on Foata normal form. 278/6206 useless extension candidates. Maximal degree in co-relation 17338. Up to 3023 conditions per place. [2025-02-08 01:04:40,999 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 74 selfloop transitions, 5 changer transitions 1/85 dead transitions. [2025-02-08 01:04:41,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 687 flow [2025-02-08 01:04:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:04:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:04:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-02-08 01:04:41,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2025-02-08 01:04:41,003 INFO L175 Difference]: Start difference. First operand has 73 places, 40 transitions, 239 flow. Second operand 4 states and 101 transitions. [2025-02-08 01:04:41,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 687 flow [2025-02-08 01:04:41,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 534 flow, removed 17 selfloop flow, removed 14 redundant places. [2025-02-08 01:04:41,200 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 202 flow [2025-02-08 01:04:41,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2025-02-08 01:04:41,202 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2025-02-08 01:04:41,202 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 202 flow [2025-02-08 01:04:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:41,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:41,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:41,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:04:41,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:41,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash -17706916, now seen corresponding path program 1 times [2025-02-08 01:04:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251859176] [2025-02-08 01:04:41,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:41,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:04:41,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:04:41,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:41,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:41,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:41,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251859176] [2025-02-08 01:04:41,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251859176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:41,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:04:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90240348] [2025-02-08 01:04:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:41,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:04:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:41,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:04:41,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:04:41,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-08 01:04:41,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:41,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:41,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-08 01:04:41,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:41,596 INFO L124 PetriNetUnfolderBase]: 2317/3709 cut-off events. [2025-02-08 01:04:41,597 INFO L125 PetriNetUnfolderBase]: For 3320/3321 co-relation queries the response was YES. [2025-02-08 01:04:41,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10356 conditions, 3709 events. 2317/3709 cut-off events. For 3320/3321 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 18909 event pairs, 341 based on Foata normal form. 212/3920 useless extension candidates. Maximal degree in co-relation 10342. Up to 1137 conditions per place. [2025-02-08 01:04:41,612 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 82 selfloop transitions, 8 changer transitions 2/97 dead transitions. [2025-02-08 01:04:41,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 629 flow [2025-02-08 01:04:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:04:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:04:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-02-08 01:04:41,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-02-08 01:04:41,613 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 202 flow. Second operand 5 states and 125 transitions. [2025-02-08 01:04:41,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 629 flow [2025-02-08 01:04:41,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 97 transitions, 609 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 01:04:41,618 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 235 flow [2025-02-08 01:04:41,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-02-08 01:04:41,619 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-02-08 01:04:41,619 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 235 flow [2025-02-08 01:04:41,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:41,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:41,619 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] [2025-02-08 01:04:41,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:04:41,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:41,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1626504240, now seen corresponding path program 1 times [2025-02-08 01:04:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:41,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936998265] [2025-02-08 01:04:41,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:41,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:04:41,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:04:41,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:41,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:41,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:41,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936998265] [2025-02-08 01:04:41,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936998265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:41,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:41,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:04:41,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278863411] [2025-02-08 01:04:41,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:41,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:41,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:41,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:41,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:41,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-08 01:04:41,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:41,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:41,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-08 01:04:41,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:41,902 INFO L124 PetriNetUnfolderBase]: 1453/2289 cut-off events. [2025-02-08 01:04:41,902 INFO L125 PetriNetUnfolderBase]: For 3166/3167 co-relation queries the response was YES. [2025-02-08 01:04:41,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6915 conditions, 2289 events. 1453/2289 cut-off events. For 3166/3167 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10321 event pairs, 279 based on Foata normal form. 92/2380 useless extension candidates. Maximal degree in co-relation 6901. Up to 788 conditions per place. [2025-02-08 01:04:41,910 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 64 selfloop transitions, 11 changer transitions 9/89 dead transitions. [2025-02-08 01:04:41,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 581 flow [2025-02-08 01:04:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:04:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:04:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-02-08 01:04:41,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5427350427350427 [2025-02-08 01:04:41,913 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 235 flow. Second operand 6 states and 127 transitions. [2025-02-08 01:04:41,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 581 flow [2025-02-08 01:04:41,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 544 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 01:04:41,921 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 240 flow [2025-02-08 01:04:41,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-02-08 01:04:41,921 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2025-02-08 01:04:41,921 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 240 flow [2025-02-08 01:04:41,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:41,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:04:41,922 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] [2025-02-08 01:04:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:04:41,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:04:41,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:04:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash -646877146, now seen corresponding path program 1 times [2025-02-08 01:04:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:04:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555244925] [2025-02-08 01:04:41,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:04:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:04:41,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:04:41,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:04:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:04:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:04:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:04:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:04:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555244925] [2025-02-08 01:04:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555244925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:04:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:04:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:04:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032275703] [2025-02-08 01:04:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:04:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:04:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:04:42,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:04:42,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:04:42,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-02-08 01:04:42,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:42,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:04:42,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-02-08 01:04:42,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:04:42,415 INFO L124 PetriNetUnfolderBase]: 1753/2742 cut-off events. [2025-02-08 01:04:42,415 INFO L125 PetriNetUnfolderBase]: For 3932/3932 co-relation queries the response was YES. [2025-02-08 01:04:42,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8360 conditions, 2742 events. 1753/2742 cut-off events. For 3932/3932 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12811 event pairs, 468 based on Foata normal form. 8/2749 useless extension candidates. Maximal degree in co-relation 8346. Up to 1395 conditions per place. [2025-02-08 01:04:42,420 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2025-02-08 01:04:42,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 582 flow [2025-02-08 01:04:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:04:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:04:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2025-02-08 01:04:42,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-02-08 01:04:42,422 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 240 flow. Second operand 6 states and 104 transitions. [2025-02-08 01:04:42,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 582 flow [2025-02-08 01:04:42,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 453 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-02-08 01:04:42,431 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-02-08 01:04:42,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-02-08 01:04:42,432 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2025-02-08 01:04:42,432 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-02-08 01:04:42,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:04:42,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-02-08 01:04:42,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-02-08 01:04:42,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 01:04:42,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-08 01:04:42,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:04:42,435 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:04:42,438 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:04:42,438 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:04:42,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:04:42 BasicIcfg [2025-02-08 01:04:42,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:04:42,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:04:42,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:04:42,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:04:42,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:04:33" (3/4) ... [2025-02-08 01:04:42,447 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:04:42,450 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-02-08 01:04:42,450 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-02-08 01:04:42,450 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-02-08 01:04:42,453 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-02-08 01:04:42,453 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 01:04:42,453 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 01:04:42,453 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:04:42,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:04:42,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:04:42,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:04:42,510 INFO L158 Benchmark]: Toolchain (without parser) took 10337.06ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 113.4MB in the beginning and 768.4MB in the end (delta: -655.0MB). Peak memory consumption was 290.4MB. Max. memory is 16.1GB. [2025-02-08 01:04:42,511 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:04:42,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.86ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 93.0MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:04:42,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.58ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:04:42,511 INFO L158 Benchmark]: Boogie Preprocessor took 44.17ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:04:42,511 INFO L158 Benchmark]: IcfgBuilder took 412.22ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 70.7MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 01:04:42,512 INFO L158 Benchmark]: TraceAbstraction took 9401.42ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 70.7MB in the beginning and 772.6MB in the end (delta: -701.9MB). Peak memory consumption was 248.5MB. Max. memory is 16.1GB. [2025-02-08 01:04:42,512 INFO L158 Benchmark]: Witness Printer took 65.14ms. Allocated memory is still 1.1GB. Free memory was 772.6MB in the beginning and 768.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:04:42,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.86ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 93.0MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.58ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.17ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 412.22ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 70.7MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9401.42ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 70.7MB in the beginning and 772.6MB in the end (delta: -701.9MB). Peak memory consumption was 248.5MB. Max. memory is 16.1GB. * Witness Printer took 65.14ms. Allocated memory is still 1.1GB. Free memory was 772.6MB in the beginning and 768.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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 7 procedures, 64 locations, 4 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: 9.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 825 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 819 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1771 IncrementalHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 9 mSDtfsCounter, 1771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=4, 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, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:04:42,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE