./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi002_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/rfi002_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 48e6a57243e80a87d178da358ff4ad1dd63b86003507ef0dec3764d15038130a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:02:58,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:02:58,753 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:02:58,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:02:58,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:02:58,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:02:58,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:02:58,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:02:58,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:02:58,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:02:58,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:02:58,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:02:58,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:02:58,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:02:58,784 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:02:58,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:02:58,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:02:58,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:02:58,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:02:58,785 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:02:58,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:02:58,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:02:58,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:02:58,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:02:58,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:02:58,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:02:58,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:02:58,786 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:02:58,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:02:58,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:02:58,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:02:58,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:02:58,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:02:58,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:02:58,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:02:58,787 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 -> 48e6a57243e80a87d178da358ff4ad1dd63b86003507ef0dec3764d15038130a [2025-02-08 01:02:59,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:02:59,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:02:59,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:02:59,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:02:59,115 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:02:59,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi002_tso.i [2025-02-08 01:03:00,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b04b1af2b/bdcbcd5a8f1540ed8bfdab957db63702/FLAGf2a4941d7 [2025-02-08 01:03:00,868 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:03:00,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_tso.i [2025-02-08 01:03:00,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b04b1af2b/bdcbcd5a8f1540ed8bfdab957db63702/FLAGf2a4941d7 [2025-02-08 01:03:01,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b04b1af2b/bdcbcd5a8f1540ed8bfdab957db63702 [2025-02-08 01:03:01,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:03:01,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:03:01,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:03:01,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:03:01,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:03:01,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae2a5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01, skipping insertion in model container [2025-02-08 01:03:01,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:03:01,293 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/rfi002_tso.i[987,1000] [2025-02-08 01:03:01,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:03:01,608 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:03:01,618 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/rfi002_tso.i[987,1000] [2025-02-08 01:03:01,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:03:01,762 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:03:01,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01 WrapperNode [2025-02-08 01:03:01,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:03:01,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:03:01,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:03:01,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:03:01,772 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:03:01" (1/1) ... [2025-02-08 01:03:01,793 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:03:01" (1/1) ... [2025-02-08 01:03:01,822 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 206 [2025-02-08 01:03:01,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:03:01,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:03:01,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:03:01,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:03:01,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,867 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:03:01,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:03:01,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:03:01,889 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:03:01,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:03:01,890 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (1/1) ... [2025-02-08 01:03:01,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:03:01,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:03:01,932 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:03:01,936 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:03:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 01:03:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 01:03:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:03:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:03:01,963 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:03:02,115 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:03:02,117 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:03:02,701 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:03:02,701 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:03:03,114 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:03:03,115 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:03:03,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:03:03 BoogieIcfgContainer [2025-02-08 01:03:03,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:03:03,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:03:03,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:03:03,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:03:03,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:03:01" (1/3) ... [2025-02-08 01:03:03,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efdfb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:03:03, skipping insertion in model container [2025-02-08 01:03:03,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:03:01" (2/3) ... [2025-02-08 01:03:03,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efdfb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:03:03, skipping insertion in model container [2025-02-08 01:03:03,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:03:03" (3/3) ... [2025-02-08 01:03:03,127 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi002_tso.i [2025-02-08 01:03:03,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:03:03,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi002_tso.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 01:03:03,145 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:03:03,225 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:03:03,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 76 flow [2025-02-08 01:03:03,299 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-02-08 01:03:03,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:03:03,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 1/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-02-08 01:03:03,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 34 transitions, 76 flow [2025-02-08 01:03:03,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 70 flow [2025-02-08 01:03:03,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:03:03,336 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;@6355648b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:03:03,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 01:03:03,346 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:03:03,348 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 01:03:03,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:03:03,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:03,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 01:03:03,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:03,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:03,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1789644318, now seen corresponding path program 1 times [2025-02-08 01:03:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462851840] [2025-02-08 01:03:03,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:03,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 01:03:03,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 01:03:03,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:03,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:03:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:03,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462851840] [2025-02-08 01:03:03,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462851840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:03,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:03,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 01:03:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604711947] [2025-02-08 01:03:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:03,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:03:03,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:03,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:03:03,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:03:03,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-02-08 01:03:03,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:03:03,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:03,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-02-08 01:03:03,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:04,579 INFO L124 PetriNetUnfolderBase]: 830/1373 cut-off events. [2025-02-08 01:03:04,579 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 01:03:04,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1373 events. 830/1373 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6621 event pairs, 54 based on Foata normal form. 63/1372 useless extension candidates. Maximal degree in co-relation 2732. Up to 1225 conditions per place. [2025-02-08 01:03:04,597 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 36 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-02-08 01:03:04,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 168 flow [2025-02-08 01:03:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:03:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:03:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-02-08 01:03:04,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-02-08 01:03:04,616 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 70 flow. Second operand 3 states and 62 transitions. [2025-02-08 01:03:04,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 168 flow [2025-02-08 01:03:04,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:03:04,624 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-02-08 01:03:04,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-02-08 01:03:04,630 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-02-08 01:03:04,630 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-02-08 01:03:04,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:03:04,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:04,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:03:04,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:03:04,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:04,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 355601539, now seen corresponding path program 1 times [2025-02-08 01:03:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:04,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111152224] [2025-02-08 01:03:04,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:04,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:04,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 01:03:04,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 01:03:04,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:04,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:04,938 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:03:04,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:04,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111152224] [2025-02-08 01:03:04,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111152224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:04,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:04,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 01:03:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496701302] [2025-02-08 01:03:04,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:04,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:03:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:04,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:03:04,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:03:04,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-02-08 01:03:04,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:03:04,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:04,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-02-08 01:03:04,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:05,323 INFO L124 PetriNetUnfolderBase]: 733/1241 cut-off events. [2025-02-08 01:03:05,324 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-08 01:03:05,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 1241 events. 733/1241 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6064 event pairs, 151 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 2503. Up to 919 conditions per place. [2025-02-08 01:03:05,335 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2025-02-08 01:03:05,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 166 flow [2025-02-08 01:03:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:03:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:03:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-08 01:03:05,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-02-08 01:03:05,339 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 3 states and 59 transitions. [2025-02-08 01:03:05,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 166 flow [2025-02-08 01:03:05,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:03:05,340 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-02-08 01:03:05,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-02-08 01:03:05,342 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-02-08 01:03:05,342 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-02-08 01:03:05,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:03:05,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:05,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:03:05,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:03:05,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:05,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1367548297, now seen corresponding path program 1 times [2025-02-08 01:03:05,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:05,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116026004] [2025-02-08 01:03:05,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:05,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 01:03:05,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 01:03:05,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:05,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:06,167 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:03:06,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:06,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116026004] [2025-02-08 01:03:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116026004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:06,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:06,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:03:06,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523854746] [2025-02-08 01:03:06,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:06,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:03:06,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:06,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:03:06,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:03:06,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:06,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:03:06,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:06,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:06,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:06,972 INFO L124 PetriNetUnfolderBase]: 909/1535 cut-off events. [2025-02-08 01:03:06,972 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-02-08 01:03:06,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 1535 events. 909/1535 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7556 event pairs, 238 based on Foata normal form. 0/1502 useless extension candidates. Maximal degree in co-relation 3117. Up to 697 conditions per place. [2025-02-08 01:03:06,979 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 35 selfloop transitions, 2 changer transitions 56/96 dead transitions. [2025-02-08 01:03:06,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 96 transitions, 400 flow [2025-02-08 01:03:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:03:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:03:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2025-02-08 01:03:06,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4963235294117647 [2025-02-08 01:03:06,981 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 135 transitions. [2025-02-08 01:03:06,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 96 transitions, 400 flow [2025-02-08 01:03:06,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 96 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:03:06,987 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 74 flow [2025-02-08 01:03:06,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2025-02-08 01:03:06,988 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-02-08 01:03:06,989 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 74 flow [2025-02-08 01:03:06,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:03:06,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:06,989 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:03:06,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:03:06,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:06,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1848211821, now seen corresponding path program 1 times [2025-02-08 01:03:06,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:06,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646711105] [2025-02-08 01:03:06,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:07,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:03:07,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:03:07,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:07,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:07,685 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:03:07,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:07,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646711105] [2025-02-08 01:03:07,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646711105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:07,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:07,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:03:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702358223] [2025-02-08 01:03:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:07,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:03:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:07,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:03:07,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:03:07,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:07,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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:03:07,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:07,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:07,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:08,172 INFO L124 PetriNetUnfolderBase]: 619/1061 cut-off events. [2025-02-08 01:03:08,172 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-02-08 01:03:08,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 1061 events. 619/1061 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4564 event pairs, 200 based on Foata normal form. 32/1092 useless extension candidates. Maximal degree in co-relation 2369. Up to 619 conditions per place. [2025-02-08 01:03:08,178 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 32 selfloop transitions, 2 changer transitions 29/66 dead transitions. [2025-02-08 01:03:08,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 291 flow [2025-02-08 01:03:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:03:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:03:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-02-08 01:03:08,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42016806722689076 [2025-02-08 01:03:08,180 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 74 flow. Second operand 7 states and 100 transitions. [2025-02-08 01:03:08,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 291 flow [2025-02-08 01:03:08,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 269 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 01:03:08,185 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2025-02-08 01:03:08,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2025-02-08 01:03:08,186 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-02-08 01:03:08,186 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2025-02-08 01:03:08,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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:03:08,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:08,187 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] [2025-02-08 01:03:08,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:03:08,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:08,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1584685546, now seen corresponding path program 1 times [2025-02-08 01:03:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:08,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76329401] [2025-02-08 01:03:08,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:08,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:03:08,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:03:08,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:08,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:10,174 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:03:10,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:10,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76329401] [2025-02-08 01:03:10,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76329401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:10,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:03:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363735025] [2025-02-08 01:03:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:10,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:03:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:10,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:03:10,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:03:10,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:10,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:03:10,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:10,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:10,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:10,919 INFO L124 PetriNetUnfolderBase]: 681/1162 cut-off events. [2025-02-08 01:03:10,919 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2025-02-08 01:03:10,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 1162 events. 681/1162 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5013 event pairs, 63 based on Foata normal form. 24/1185 useless extension candidates. Maximal degree in co-relation 2611. Up to 750 conditions per place. [2025-02-08 01:03:10,929 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 44 selfloop transitions, 10 changer transitions 27/84 dead transitions. [2025-02-08 01:03:10,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 372 flow [2025-02-08 01:03:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:03:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:03:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2025-02-08 01:03:10,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2025-02-08 01:03:10,934 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 10 states and 133 transitions. [2025-02-08 01:03:10,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 372 flow [2025-02-08 01:03:10,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 84 transitions, 350 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 01:03:10,943 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 151 flow [2025-02-08 01:03:10,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-02-08 01:03:10,944 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-02-08 01:03:10,946 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 151 flow [2025-02-08 01:03:10,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:03:10,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:10,947 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] [2025-02-08 01:03:10,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:03:10,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:10,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1797297444, now seen corresponding path program 2 times [2025-02-08 01:03:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:10,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066564370] [2025-02-08 01:03:10,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:03:10,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:10,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:03:11,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:03:11,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:03:11,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:12,671 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:03:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066564370] [2025-02-08 01:03:12,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066564370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:12,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:12,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:03:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851519429] [2025-02-08 01:03:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:12,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:03:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:12,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:03:12,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:03:12,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:12,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 151 flow. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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:03:12,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:12,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:12,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:13,429 INFO L124 PetriNetUnfolderBase]: 739/1259 cut-off events. [2025-02-08 01:03:13,430 INFO L125 PetriNetUnfolderBase]: For 1028/1028 co-relation queries the response was YES. [2025-02-08 01:03:13,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 1259 events. 739/1259 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5597 event pairs, 46 based on Foata normal form. 20/1278 useless extension candidates. Maximal degree in co-relation 3745. Up to 630 conditions per place. [2025-02-08 01:03:13,440 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 65 selfloop transitions, 11 changer transitions 16/95 dead transitions. [2025-02-08 01:03:13,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 553 flow [2025-02-08 01:03:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:03:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:03:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-02-08 01:03:13,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42483660130718953 [2025-02-08 01:03:13,442 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 151 flow. Second operand 9 states and 130 transitions. [2025-02-08 01:03:13,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 553 flow [2025-02-08 01:03:13,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 546 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-08 01:03:13,447 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 221 flow [2025-02-08 01:03:13,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2025-02-08 01:03:13,448 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-02-08 01:03:13,448 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 221 flow [2025-02-08 01:03:13,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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:03:13,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:13,448 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] [2025-02-08 01:03:13,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:03:13,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:13,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1889280328, now seen corresponding path program 3 times [2025-02-08 01:03:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:13,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394151868] [2025-02-08 01:03:13,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:03:13,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:13,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:03:13,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:03:13,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:03:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:14,987 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:03:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394151868] [2025-02-08 01:03:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394151868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:14,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:14,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:03:14,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149954178] [2025-02-08 01:03:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:14,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:03:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:14,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:03:14,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:03:14,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:14,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 221 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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:03:14,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:14,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:14,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:15,949 INFO L124 PetriNetUnfolderBase]: 831/1411 cut-off events. [2025-02-08 01:03:15,949 INFO L125 PetriNetUnfolderBase]: For 1830/1830 co-relation queries the response was YES. [2025-02-08 01:03:15,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 1411 events. 831/1411 cut-off events. For 1830/1830 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6446 event pairs, 70 based on Foata normal form. 23/1433 useless extension candidates. Maximal degree in co-relation 4648. Up to 903 conditions per place. [2025-02-08 01:03:15,963 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 70 selfloop transitions, 25 changer transitions 25/123 dead transitions. [2025-02-08 01:03:15,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 808 flow [2025-02-08 01:03:15,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 01:03:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 01:03:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2025-02-08 01:03:15,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4004524886877828 [2025-02-08 01:03:15,964 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 221 flow. Second operand 13 states and 177 transitions. [2025-02-08 01:03:15,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 808 flow [2025-02-08 01:03:15,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 123 transitions, 778 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-02-08 01:03:15,972 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 415 flow [2025-02-08 01:03:15,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=415, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2025-02-08 01:03:15,974 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2025-02-08 01:03:15,974 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 415 flow [2025-02-08 01:03:15,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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:03:15,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:15,975 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:03:15,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:03:15,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:15,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash -167394574, now seen corresponding path program 1 times [2025-02-08 01:03:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392354791] [2025-02-08 01:03:15,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:15,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:03:16,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:03:16,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:16,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:17,932 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:03:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392354791] [2025-02-08 01:03:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392354791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:17,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:17,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:03:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073271514] [2025-02-08 01:03:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:17,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:03:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:17,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:03:17,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:03:17,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:17,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 415 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:03:17,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:17,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:17,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:19,005 INFO L124 PetriNetUnfolderBase]: 937/1585 cut-off events. [2025-02-08 01:03:19,005 INFO L125 PetriNetUnfolderBase]: For 4845/4845 co-relation queries the response was YES. [2025-02-08 01:03:19,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6186 conditions, 1585 events. 937/1585 cut-off events. For 4845/4845 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7474 event pairs, 125 based on Foata normal form. 15/1599 useless extension candidates. Maximal degree in co-relation 6157. Up to 902 conditions per place. [2025-02-08 01:03:19,023 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 66 selfloop transitions, 33 changer transitions 19/121 dead transitions. [2025-02-08 01:03:19,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 1040 flow [2025-02-08 01:03:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:03:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:03:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2025-02-08 01:03:19,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3983957219251337 [2025-02-08 01:03:19,026 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 415 flow. Second operand 11 states and 149 transitions. [2025-02-08 01:03:19,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 1040 flow [2025-02-08 01:03:19,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 121 transitions, 966 flow, removed 32 selfloop flow, removed 6 redundant places. [2025-02-08 01:03:19,046 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 670 flow [2025-02-08 01:03:19,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=670, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-02-08 01:03:19,047 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 41 predicate places. [2025-02-08 01:03:19,047 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 670 flow [2025-02-08 01:03:19,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:03:19,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:19,048 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:03:19,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:03:19,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:19,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -846249435, now seen corresponding path program 1 times [2025-02-08 01:03:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:19,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129966183] [2025-02-08 01:03:19,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:19,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:03:19,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:03:19,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:19,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:19,688 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:03:19,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:19,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129966183] [2025-02-08 01:03:19,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129966183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:19,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:03:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173282461] [2025-02-08 01:03:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:03:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:19,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:03:19,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:03:19,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:19,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 670 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:03:19,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:19,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:19,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:20,619 INFO L124 PetriNetUnfolderBase]: 1125/1921 cut-off events. [2025-02-08 01:03:20,619 INFO L125 PetriNetUnfolderBase]: For 7820/7820 co-relation queries the response was YES. [2025-02-08 01:03:20,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8180 conditions, 1921 events. 1125/1921 cut-off events. For 7820/7820 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9638 event pairs, 235 based on Foata normal form. 20/1940 useless extension candidates. Maximal degree in co-relation 8146. Up to 637 conditions per place. [2025-02-08 01:03:20,635 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 55 selfloop transitions, 23 changer transitions 73/154 dead transitions. [2025-02-08 01:03:20,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 154 transitions, 1542 flow [2025-02-08 01:03:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:03:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:03:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2025-02-08 01:03:20,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2025-02-08 01:03:20,637 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 670 flow. Second operand 10 states and 150 transitions. [2025-02-08 01:03:20,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 154 transitions, 1542 flow [2025-02-08 01:03:20,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 154 transitions, 1481 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-02-08 01:03:20,659 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 707 flow [2025-02-08 01:03:20,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=707, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2025-02-08 01:03:20,662 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2025-02-08 01:03:20,662 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 707 flow [2025-02-08 01:03:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:03:20,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:20,662 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:03:20,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:03:20,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:20,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:20,663 INFO L85 PathProgramCache]: Analyzing trace with hash 460285686, now seen corresponding path program 2 times [2025-02-08 01:03:20,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:20,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990167026] [2025-02-08 01:03:20,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:03:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:20,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:03:20,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:03:20,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:03:20,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:03:20,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:20,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990167026] [2025-02-08 01:03:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990167026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:20,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:03:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950827117] [2025-02-08 01:03:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:20,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:03:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:20,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:03:20,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:03:20,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-02-08 01:03:20,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 707 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:03:20,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:20,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-02-08 01:03:20,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:21,152 INFO L124 PetriNetUnfolderBase]: 398/766 cut-off events. [2025-02-08 01:03:21,153 INFO L125 PetriNetUnfolderBase]: For 3306/3306 co-relation queries the response was YES. [2025-02-08 01:03:21,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 766 events. 398/766 cut-off events. For 3306/3306 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3322 event pairs, 166 based on Foata normal form. 74/839 useless extension candidates. Maximal degree in co-relation 3023. Up to 313 conditions per place. [2025-02-08 01:03:21,159 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 48 selfloop transitions, 4 changer transitions 3/59 dead transitions. [2025-02-08 01:03:21,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 59 transitions, 616 flow [2025-02-08 01:03:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:03:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:03:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-02-08 01:03:21,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2025-02-08 01:03:21,161 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 707 flow. Second operand 4 states and 69 transitions. [2025-02-08 01:03:21,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 59 transitions, 616 flow [2025-02-08 01:03:21,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 501 flow, removed 35 selfloop flow, removed 18 redundant places. [2025-02-08 01:03:21,173 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 326 flow [2025-02-08 01:03:21,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-02-08 01:03:21,176 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2025-02-08 01:03:21,177 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 326 flow [2025-02-08 01:03:21,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:03:21,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:21,177 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] [2025-02-08 01:03:21,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:03:21,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:21,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1607696647, now seen corresponding path program 1 times [2025-02-08 01:03:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562667498] [2025-02-08 01:03:21,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:21,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:03:21,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:03:21,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:21,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:23,354 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:03:23,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:23,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562667498] [2025-02-08 01:03:23,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562667498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:23,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:23,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:03:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060427759] [2025-02-08 01:03:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:23,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:03:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:23,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:03:23,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:03:23,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:23,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 326 flow. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 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:03:23,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:23,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:23,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:24,069 INFO L124 PetriNetUnfolderBase]: 348/657 cut-off events. [2025-02-08 01:03:24,069 INFO L125 PetriNetUnfolderBase]: For 1712/1712 co-relation queries the response was YES. [2025-02-08 01:03:24,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 657 events. 348/657 cut-off events. For 1712/1712 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2573 event pairs, 58 based on Foata normal form. 10/666 useless extension candidates. Maximal degree in co-relation 2422. Up to 349 conditions per place. [2025-02-08 01:03:24,075 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 48 selfloop transitions, 14 changer transitions 15/80 dead transitions. [2025-02-08 01:03:24,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 80 transitions, 650 flow [2025-02-08 01:03:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:03:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:03:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2025-02-08 01:03:24,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32598039215686275 [2025-02-08 01:03:24,077 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 326 flow. Second operand 12 states and 133 transitions. [2025-02-08 01:03:24,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 80 transitions, 650 flow [2025-02-08 01:03:24,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 595 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-02-08 01:03:24,083 INFO L231 Difference]: Finished difference. Result has 77 places, 44 transitions, 350 flow [2025-02-08 01:03:24,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2025-02-08 01:03:24,084 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 39 predicate places. [2025-02-08 01:03:24,084 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 44 transitions, 350 flow [2025-02-08 01:03:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 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:03:24,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:24,085 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] [2025-02-08 01:03:24,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:03:24,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:24,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash -594140213, now seen corresponding path program 2 times [2025-02-08 01:03:24,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:24,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469065778] [2025-02-08 01:03:24,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:03:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:24,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:03:24,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:03:24,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:03:24,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:25,678 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:03:25,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:25,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469065778] [2025-02-08 01:03:25,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469065778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:25,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:25,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:03:25,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198931230] [2025-02-08 01:03:25,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:25,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:03:25,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:25,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:03:25,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:03:25,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:25,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 44 transitions, 350 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:03:25,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:25,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:25,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:26,453 INFO L124 PetriNetUnfolderBase]: 349/655 cut-off events. [2025-02-08 01:03:26,453 INFO L125 PetriNetUnfolderBase]: For 1956/1956 co-relation queries the response was YES. [2025-02-08 01:03:26,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 655 events. 349/655 cut-off events. For 1956/1956 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2593 event pairs, 47 based on Foata normal form. 10/664 useless extension candidates. Maximal degree in co-relation 2409. Up to 217 conditions per place. [2025-02-08 01:03:26,458 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 55 selfloop transitions, 16 changer transitions 15/89 dead transitions. [2025-02-08 01:03:26,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 736 flow [2025-02-08 01:03:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 01:03:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 01:03:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2025-02-08 01:03:26,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3257918552036199 [2025-02-08 01:03:26,462 INFO L175 Difference]: Start difference. First operand has 77 places, 44 transitions, 350 flow. Second operand 13 states and 144 transitions. [2025-02-08 01:03:26,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 736 flow [2025-02-08 01:03:26,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 662 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-02-08 01:03:26,467 INFO L231 Difference]: Finished difference. Result has 81 places, 45 transitions, 363 flow [2025-02-08 01:03:26,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=363, PETRI_PLACES=81, PETRI_TRANSITIONS=45} [2025-02-08 01:03:26,468 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2025-02-08 01:03:26,468 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 45 transitions, 363 flow [2025-02-08 01:03:26,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:03:26,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:26,469 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:03:26,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:03:26,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:26,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:26,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1816477692, now seen corresponding path program 1 times [2025-02-08 01:03:26,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:26,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861747150] [2025-02-08 01:03:26,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:26,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:26,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:03:26,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:03:26,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:26,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:27,873 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:03:27,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:27,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861747150] [2025-02-08 01:03:27,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861747150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:27,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:27,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:03:27,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841467162] [2025-02-08 01:03:27,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:27,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:03:27,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:27,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:03:27,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:03:27,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:27,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 45 transitions, 363 flow. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:03:27,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:27,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:27,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:28,626 INFO L124 PetriNetUnfolderBase]: 343/649 cut-off events. [2025-02-08 01:03:28,627 INFO L125 PetriNetUnfolderBase]: For 1953/1953 co-relation queries the response was YES. [2025-02-08 01:03:28,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 649 events. 343/649 cut-off events. For 1953/1953 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2522 event pairs, 146 based on Foata normal form. 8/656 useless extension candidates. Maximal degree in co-relation 2365. Up to 393 conditions per place. [2025-02-08 01:03:28,635 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 39 selfloop transitions, 10 changer transitions 28/80 dead transitions. [2025-02-08 01:03:28,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 80 transitions, 659 flow [2025-02-08 01:03:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 01:03:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 01:03:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2025-02-08 01:03:28,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30995475113122173 [2025-02-08 01:03:28,637 INFO L175 Difference]: Start difference. First operand has 81 places, 45 transitions, 363 flow. Second operand 13 states and 137 transitions. [2025-02-08 01:03:28,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 80 transitions, 659 flow [2025-02-08 01:03:28,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 80 transitions, 608 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-02-08 01:03:28,644 INFO L231 Difference]: Finished difference. Result has 87 places, 39 transitions, 305 flow [2025-02-08 01:03:28,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=305, PETRI_PLACES=87, PETRI_TRANSITIONS=39} [2025-02-08 01:03:28,645 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2025-02-08 01:03:28,645 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 39 transitions, 305 flow [2025-02-08 01:03:28,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:03:28,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:28,646 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:03:28,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:03:28,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:28,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash 634474302, now seen corresponding path program 2 times [2025-02-08 01:03:28,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:28,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863187125] [2025-02-08 01:03:28,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:03:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:28,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:03:28,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:03:28,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:03:28,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:03:29,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:29,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863187125] [2025-02-08 01:03:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863187125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:03:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575244535] [2025-02-08 01:03:29,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:29,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:03:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:29,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:03:29,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:03:29,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:29,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 39 transitions, 305 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:03:29,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:29,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:29,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:30,011 INFO L124 PetriNetUnfolderBase]: 276/520 cut-off events. [2025-02-08 01:03:30,011 INFO L125 PetriNetUnfolderBase]: For 1431/1431 co-relation queries the response was YES. [2025-02-08 01:03:30,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 520 events. 276/520 cut-off events. For 1431/1431 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1862 event pairs, 90 based on Foata normal form. 8/527 useless extension candidates. Maximal degree in co-relation 1859. Up to 380 conditions per place. [2025-02-08 01:03:30,015 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 35 selfloop transitions, 10 changer transitions 13/61 dead transitions. [2025-02-08 01:03:30,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 61 transitions, 524 flow [2025-02-08 01:03:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:03:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:03:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-02-08 01:03:30,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3137254901960784 [2025-02-08 01:03:30,017 INFO L175 Difference]: Start difference. First operand has 87 places, 39 transitions, 305 flow. Second operand 9 states and 96 transitions. [2025-02-08 01:03:30,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 61 transitions, 524 flow [2025-02-08 01:03:30,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 421 flow, removed 23 selfloop flow, removed 19 redundant places. [2025-02-08 01:03:30,023 INFO L231 Difference]: Finished difference. Result has 72 places, 39 transitions, 265 flow [2025-02-08 01:03:30,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=265, PETRI_PLACES=72, PETRI_TRANSITIONS=39} [2025-02-08 01:03:30,023 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 34 predicate places. [2025-02-08 01:03:30,024 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 39 transitions, 265 flow [2025-02-08 01:03:30,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:03:30,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:30,024 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] [2025-02-08 01:03:30,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:03:30,025 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:30,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:30,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1297562726, now seen corresponding path program 1 times [2025-02-08 01:03:30,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:30,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443661458] [2025-02-08 01:03:30,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:03:30,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:30,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:03:30,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:03:30,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:03:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:31,622 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:03:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443661458] [2025-02-08 01:03:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443661458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:31,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:03:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913991651] [2025-02-08 01:03:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:31,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:03:31,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:31,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:03:31,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:03:31,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:31,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 39 transitions, 265 flow. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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:03:31,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:31,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:31,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:32,192 INFO L124 PetriNetUnfolderBase]: 343/641 cut-off events. [2025-02-08 01:03:32,193 INFO L125 PetriNetUnfolderBase]: For 1200/1200 co-relation queries the response was YES. [2025-02-08 01:03:32,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 641 events. 343/641 cut-off events. For 1200/1200 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2458 event pairs, 81 based on Foata normal form. 8/648 useless extension candidates. Maximal degree in co-relation 2111. Up to 307 conditions per place. [2025-02-08 01:03:32,200 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 43 selfloop transitions, 11 changer transitions 27/84 dead transitions. [2025-02-08 01:03:32,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 597 flow [2025-02-08 01:03:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:03:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:03:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2025-02-08 01:03:32,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3588235294117647 [2025-02-08 01:03:32,203 INFO L175 Difference]: Start difference. First operand has 72 places, 39 transitions, 265 flow. Second operand 10 states and 122 transitions. [2025-02-08 01:03:32,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 597 flow [2025-02-08 01:03:32,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 541 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-02-08 01:03:32,207 INFO L231 Difference]: Finished difference. Result has 72 places, 40 transitions, 273 flow [2025-02-08 01:03:32,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=273, PETRI_PLACES=72, PETRI_TRANSITIONS=40} [2025-02-08 01:03:32,208 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 34 predicate places. [2025-02-08 01:03:32,209 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 40 transitions, 273 flow [2025-02-08 01:03:32,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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:03:32,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:03:32,209 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] [2025-02-08 01:03:32,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:03:32,210 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 01:03:32,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:03:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1932037350, now seen corresponding path program 2 times [2025-02-08 01:03:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:03:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267756339] [2025-02-08 01:03:32,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:03:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:03:32,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:03:32,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:03:32,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:03:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:03:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:03:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:03:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267756339] [2025-02-08 01:03:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267756339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:03:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:03:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:03:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450616525] [2025-02-08 01:03:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:03:33,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:03:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:03:33,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:03:33,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:03:33,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-02-08 01:03:33,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 40 transitions, 273 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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:03:33,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:03:33,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-02-08 01:03:33,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:03:34,054 INFO L124 PetriNetUnfolderBase]: 243/456 cut-off events. [2025-02-08 01:03:34,055 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES. [2025-02-08 01:03:34,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 456 events. 243/456 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1585 event pairs, 93 based on Foata normal form. 8/463 useless extension candidates. Maximal degree in co-relation 1531. Up to 267 conditions per place. [2025-02-08 01:03:34,056 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 0 selfloop transitions, 0 changer transitions 63/63 dead transitions. [2025-02-08 01:03:34,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 63 transitions, 474 flow [2025-02-08 01:03:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:03:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:03:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-02-08 01:03:34,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31699346405228757 [2025-02-08 01:03:34,057 INFO L175 Difference]: Start difference. First operand has 72 places, 40 transitions, 273 flow. Second operand 9 states and 97 transitions. [2025-02-08 01:03:34,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 63 transitions, 474 flow [2025-02-08 01:03:34,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 424 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-02-08 01:03:34,060 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2025-02-08 01:03:34,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2025-02-08 01:03:34,060 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2025-02-08 01:03:34,061 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2025-02-08 01:03:34,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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:03:34,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-02-08 01:03:34,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-02-08 01:03:34,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-02-08 01:03:34,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 01:03:34,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 01:03:34,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-02-08 01:03:34,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-02-08 01:03:34,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:03:34,065 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 01:03:34,069 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:03:34,069 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:03:34,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:03:34 BasicIcfg [2025-02-08 01:03:34,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:03:34,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:03:34,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:03:34,079 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:03:34,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:03:03" (3/4) ... [2025-02-08 01:03:34,081 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:03:34,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-02-08 01:03:34,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-02-08 01:03:34,088 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 52 nodes and edges [2025-02-08 01:03:34,088 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 01:03:34,088 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 01:03:34,088 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:03:34,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:03:34,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:03:34,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:03:34,169 INFO L158 Benchmark]: Toolchain (without parser) took 33104.28ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 157.3MB in the beginning and 815.4MB in the end (delta: -658.1MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2025-02-08 01:03:34,169 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:03:34,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.35ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 129.1MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:03:34,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.99ms. Allocated memory is still 201.3MB. Free memory was 129.1MB in the beginning and 125.5MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:03:34,172 INFO L158 Benchmark]: Boogie Preprocessor took 64.93ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 120.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:03:34,172 INFO L158 Benchmark]: IcfgBuilder took 1226.45ms. Allocated memory is still 201.3MB. Free memory was 120.6MB in the beginning and 121.4MB in the end (delta: -783.1kB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2025-02-08 01:03:34,173 INFO L158 Benchmark]: TraceAbstraction took 30956.59ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 120.7MB in the beginning and 819.6MB in the end (delta: -698.9MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2025-02-08 01:03:34,173 INFO L158 Benchmark]: Witness Printer took 90.36ms. Allocated memory is still 1.0GB. Free memory was 819.6MB in the beginning and 815.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:03:34,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.35ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 129.1MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.99ms. Allocated memory is still 201.3MB. Free memory was 129.1MB in the beginning and 125.5MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.93ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 120.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1226.45ms. Allocated memory is still 201.3MB. Free memory was 120.6MB in the beginning and 121.4MB in the end (delta: -783.1kB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30956.59ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 120.7MB in the beginning and 819.6MB in the end (delta: -698.9MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. * Witness Printer took 90.36ms. Allocated memory is still 1.0GB. Free memory was 819.6MB in the beginning and 815.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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 7 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: 30.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 863 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 854 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3693 IncrementalHoareTripleChecker+Invalid, 3926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 2 mSDtfsCounter, 3693 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=707occurred in iteration=9, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 4410 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:03:34,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE