./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:28:59,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:28:59,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:28:59,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:28:59,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:28:59,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:28:59,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:28:59,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:28:59,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:28:59,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:28:59,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:28:59,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:28:59,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:28:59,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:28:59,781 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:28:59,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:28:59,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:28:59,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:28:59,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:28:59,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:28:59,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:28:59,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:28:59,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:28:59,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:28:59,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:28:59,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:28:59,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:28:59,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:28:59,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:28:59,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:28:59,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:28:59,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:28:59,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:28:59,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:28:59,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:28:59,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:28:59,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:28:59,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:28:59,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:28:59,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:28:59,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:28:59,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:28:59,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:28:59,785 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-02-06 04:29:00,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:29:00,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:29:00,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:29:00,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:29:00,104 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:29:00,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-06 04:29:01,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc9d38ed0/b2dffa36029d44a69f8d86850b5ffd1c/FLAG08ff21942 [2025-02-06 04:29:01,867 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:29:01,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-06 04:29:01,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc9d38ed0/b2dffa36029d44a69f8d86850b5ffd1c/FLAG08ff21942 [2025-02-06 04:29:01,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc9d38ed0/b2dffa36029d44a69f8d86850b5ffd1c [2025-02-06 04:29:01,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:29:01,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:29:01,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:29:01,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:29:01,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:29:01,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:29:01" (1/1) ... [2025-02-06 04:29:01,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503ac4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:01, skipping insertion in model container [2025-02-06 04:29:01,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:29:01" (1/1) ... [2025-02-06 04:29:01,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:29:02,097 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-02-06 04:29:02,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:29:02,240 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:29:02,247 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-02-06 04:29:02,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:29:02,307 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:29:02,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02 WrapperNode [2025-02-06 04:29:02,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:29:02,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:29:02,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:29:02,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:29:02,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,346 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-02-06 04:29:02,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:29:02,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:29:02,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:29:02,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:29:02,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,367 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-02-06 04:29:02,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:29:02,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:29:02,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:29:02,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:29:02,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (1/1) ... [2025-02-06 04:29:02,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:29:02,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:29:02,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:29:02,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:29:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:29:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:29:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-02-06 04:29:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-02-06 04:29:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:29:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:29:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:29:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:29:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:29:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:29:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:29:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:29:02,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:29:02,447 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:29:02,563 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:29:02,565 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:29:02,783 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:29:02,783 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:29:02,919 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:29:02,919 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:29:02,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:29:02 BoogieIcfgContainer [2025-02-06 04:29:02,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:29:02,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:29:02,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:29:02,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:29:02,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:29:01" (1/3) ... [2025-02-06 04:29:02,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef95dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:29:02, skipping insertion in model container [2025-02-06 04:29:02,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:29:02" (2/3) ... [2025-02-06 04:29:02,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef95dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:29:02, skipping insertion in model container [2025-02-06 04:29:02,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:29:02" (3/3) ... [2025-02-06 04:29:02,930 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-06 04:29:02,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:29:02,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-02-06 04:29:02,946 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:29:02,994 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:29:03,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 78 flow [2025-02-06 04:29:03,051 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-02-06 04:29:03,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:29:03,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 7/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-02-06 04:29:03,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 78 flow [2025-02-06 04:29:03,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 36 transitions, 75 flow [2025-02-06 04:29:03,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:29:03,081 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;@4ed54d0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:29:03,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:29:03,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:29:03,092 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-02-06 04:29:03,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:29:03,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:03,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:03,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash -880292392, now seen corresponding path program 1 times [2025-02-06 04:29:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:03,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397121473] [2025-02-06 04:29:03,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:29:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:03,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:29:03,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:29:03,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:03,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:03,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397121473] [2025-02-06 04:29:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397121473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:03,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:03,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:29:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413908718] [2025-02-06 04:29:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:03,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:29:03,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:03,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:29:03,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:29:03,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:29:03,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:03,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:03,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:29:03,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:03,491 INFO L124 PetriNetUnfolderBase]: 107/255 cut-off events. [2025-02-06 04:29:03,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:29:03,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 255 events. 107/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 988 event pairs, 72 based on Foata normal form. 14/226 useless extension candidates. Maximal degree in co-relation 444. Up to 194 conditions per place. [2025-02-06 04:29:03,497 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 22 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-02-06 04:29:03,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 111 flow [2025-02-06 04:29:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:29:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 04:29:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2025-02-06 04:29:03,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-02-06 04:29:03,511 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 75 flow. Second operand 2 states and 48 transitions. [2025-02-06 04:29:03,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 111 flow [2025-02-06 04:29:03,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:29:03,518 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 66 flow [2025-02-06 04:29:03,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-02-06 04:29:03,526 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2025-02-06 04:29:03,526 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 66 flow [2025-02-06 04:29:03,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:03,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:03,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:03,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:29:03,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:03,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash -880260614, now seen corresponding path program 1 times [2025-02-06 04:29:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598466716] [2025-02-06 04:29:03,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:29:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:03,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:29:03,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:29:03,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:03,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:03,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598466716] [2025-02-06 04:29:03,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598466716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:03,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:03,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:29:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670479442] [2025-02-06 04:29:03,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:03,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:29:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:03,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:29:03,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:29:03,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:03,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:03,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:03,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:03,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:04,208 INFO L124 PetriNetUnfolderBase]: 224/456 cut-off events. [2025-02-06 04:29:04,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:29:04,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 456 events. 224/456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1901 event pairs, 20 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 881. Up to 250 conditions per place. [2025-02-06 04:29:04,215 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 49 selfloop transitions, 15 changer transitions 0/70 dead transitions. [2025-02-06 04:29:04,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 70 transitions, 270 flow [2025-02-06 04:29:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:29:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:29:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-02-06 04:29:04,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-02-06 04:29:04,218 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 66 flow. Second operand 6 states and 108 transitions. [2025-02-06 04:29:04,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 70 transitions, 270 flow [2025-02-06 04:29:04,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:29:04,222 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 168 flow [2025-02-06 04:29:04,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2025-02-06 04:29:04,225 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2025-02-06 04:29:04,225 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 168 flow [2025-02-06 04:29:04,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:04,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:04,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:04,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:29:04,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1518309763, now seen corresponding path program 1 times [2025-02-06 04:29:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829924784] [2025-02-06 04:29:04,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:29:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:04,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:29:04,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:29:04,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:04,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:04,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829924784] [2025-02-06 04:29:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829924784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:04,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:29:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834213007] [2025-02-06 04:29:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:29:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:04,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:29:04,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:29:04,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:04,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:04,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:04,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:04,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:04,614 INFO L124 PetriNetUnfolderBase]: 278/559 cut-off events. [2025-02-06 04:29:04,615 INFO L125 PetriNetUnfolderBase]: For 184/186 co-relation queries the response was YES. [2025-02-06 04:29:04,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 559 events. 278/559 cut-off events. For 184/186 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2449 event pairs, 60 based on Foata normal form. 20/538 useless extension candidates. Maximal degree in co-relation 1390. Up to 303 conditions per place. [2025-02-06 04:29:04,618 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 58 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-02-06 04:29:04,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 474 flow [2025-02-06 04:29:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:29:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:29:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-02-06 04:29:04,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-02-06 04:29:04,619 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 168 flow. Second operand 6 states and 108 transitions. [2025-02-06 04:29:04,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 474 flow [2025-02-06 04:29:04,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:29:04,627 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 366 flow [2025-02-06 04:29:04,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2025-02-06 04:29:04,628 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2025-02-06 04:29:04,628 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 366 flow [2025-02-06 04:29:04,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:04,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:04,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:04,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:29:04,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:04,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1895909170, now seen corresponding path program 1 times [2025-02-06 04:29:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499304368] [2025-02-06 04:29:04,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:29:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:04,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:29:04,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:29:04,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:04,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:04,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499304368] [2025-02-06 04:29:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499304368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:04,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:04,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:29:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795495496] [2025-02-06 04:29:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:04,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:29:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:04,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:29:04,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:29:04,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:29:04,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:04,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:04,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:29:04,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:05,363 INFO L124 PetriNetUnfolderBase]: 399/859 cut-off events. [2025-02-06 04:29:05,363 INFO L125 PetriNetUnfolderBase]: For 1245/1262 co-relation queries the response was YES. [2025-02-06 04:29:05,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 859 events. 399/859 cut-off events. For 1245/1262 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4782 event pairs, 86 based on Foata normal form. 16/819 useless extension candidates. Maximal degree in co-relation 2730. Up to 360 conditions per place. [2025-02-06 04:29:05,380 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-02-06 04:29:05,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 942 flow [2025-02-06 04:29:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:29:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:29:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2025-02-06 04:29:05,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2025-02-06 04:29:05,382 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 366 flow. Second operand 7 states and 159 transitions. [2025-02-06 04:29:05,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 942 flow [2025-02-06 04:29:05,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:29:05,400 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 588 flow [2025-02-06 04:29:05,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2025-02-06 04:29:05,401 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2025-02-06 04:29:05,402 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 588 flow [2025-02-06 04:29:05,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:05,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:05,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:05,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:29:05,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:05,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash -971036284, now seen corresponding path program 2 times [2025-02-06 04:29:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809853085] [2025-02-06 04:29:05,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:29:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:05,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:29:05,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:29:05,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:29:05,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:05,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:05,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809853085] [2025-02-06 04:29:05,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809853085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:05,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:05,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:29:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395689786] [2025-02-06 04:29:05,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:05,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:29:05,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:05,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:29:05,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:29:05,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:05,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06 04:29:05,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:05,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:05,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:06,463 INFO L124 PetriNetUnfolderBase]: 485/974 cut-off events. [2025-02-06 04:29:06,464 INFO L125 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2025-02-06 04:29:06,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 974 events. 485/974 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5067 event pairs, 130 based on Foata normal form. 1/974 useless extension candidates. Maximal degree in co-relation 3556. Up to 623 conditions per place. [2025-02-06 04:29:06,474 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 77 selfloop transitions, 67 changer transitions 0/150 dead transitions. [2025-02-06 04:29:06,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 1398 flow [2025-02-06 04:29:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:29:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:29:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2025-02-06 04:29:06,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39293139293139295 [2025-02-06 04:29:06,479 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 588 flow. Second operand 13 states and 189 transitions. [2025-02-06 04:29:06,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 1398 flow [2025-02-06 04:29:06,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 150 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:29:06,498 INFO L231 Difference]: Finished difference. Result has 77 places, 116 transitions, 1098 flow [2025-02-06 04:29:06,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1098, PETRI_PLACES=77, PETRI_TRANSITIONS=116} [2025-02-06 04:29:06,501 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2025-02-06 04:29:06,501 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 116 transitions, 1098 flow [2025-02-06 04:29:06,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06 04:29:06,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:06,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:06,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:29:06,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:06,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash -130582454, now seen corresponding path program 3 times [2025-02-06 04:29:06,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748223492] [2025-02-06 04:29:06,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:29:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:06,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:29:06,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:29:06,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:29:06,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:06,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:06,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748223492] [2025-02-06 04:29:06,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748223492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:06,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:06,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:29:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843947345] [2025-02-06 04:29:06,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:06,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:29:06,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:06,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:29:06,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:29:06,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:06,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 116 transitions, 1098 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06 04:29:06,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:06,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:06,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:07,385 INFO L124 PetriNetUnfolderBase]: 462/947 cut-off events. [2025-02-06 04:29:07,386 INFO L125 PetriNetUnfolderBase]: For 2547/2551 co-relation queries the response was YES. [2025-02-06 04:29:07,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 947 events. 462/947 cut-off events. For 2547/2551 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4743 event pairs, 122 based on Foata normal form. 15/960 useless extension candidates. Maximal degree in co-relation 3824. Up to 600 conditions per place. [2025-02-06 04:29:07,397 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 83 selfloop transitions, 66 changer transitions 0/155 dead transitions. [2025-02-06 04:29:07,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 155 transitions, 1596 flow [2025-02-06 04:29:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:29:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:29:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2025-02-06 04:29:07,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4099099099099099 [2025-02-06 04:29:07,399 INFO L175 Difference]: Start difference. First operand has 77 places, 116 transitions, 1098 flow. Second operand 12 states and 182 transitions. [2025-02-06 04:29:07,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 155 transitions, 1596 flow [2025-02-06 04:29:07,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 155 transitions, 1570 flow, removed 13 selfloop flow, removed 0 redundant places. [2025-02-06 04:29:07,418 INFO L231 Difference]: Finished difference. Result has 91 places, 123 transitions, 1293 flow [2025-02-06 04:29:07,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1293, PETRI_PLACES=91, PETRI_TRANSITIONS=123} [2025-02-06 04:29:07,419 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 58 predicate places. [2025-02-06 04:29:07,420 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 123 transitions, 1293 flow [2025-02-06 04:29:07,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06 04:29:07,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:07,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:07,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:29:07,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:07,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1011365910, now seen corresponding path program 4 times [2025-02-06 04:29:07,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:07,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657630847] [2025-02-06 04:29:07,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:29:07,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:07,433 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-02-06 04:29:07,437 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-02-06 04:29:07,437 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:29:07,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657630847] [2025-02-06 04:29:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657630847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:07,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:07,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:29:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201960149] [2025-02-06 04:29:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:07,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:29:07,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:07,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:29:07,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:29:07,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:29:07,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 123 transitions, 1293 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:07,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:07,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:29:07,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:07,835 INFO L124 PetriNetUnfolderBase]: 604/1256 cut-off events. [2025-02-06 04:29:07,836 INFO L125 PetriNetUnfolderBase]: For 4492/4510 co-relation queries the response was YES. [2025-02-06 04:29:07,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5427 conditions, 1256 events. 604/1256 cut-off events. For 4492/4510 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7359 event pairs, 22 based on Foata normal form. 15/1266 useless extension candidates. Maximal degree in co-relation 5400. Up to 419 conditions per place. [2025-02-06 04:29:07,849 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 192 selfloop transitions, 39 changer transitions 0/250 dead transitions. [2025-02-06 04:29:07,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 250 transitions, 2778 flow [2025-02-06 04:29:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:29:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:29:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2025-02-06 04:29:07,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6602316602316602 [2025-02-06 04:29:07,851 INFO L175 Difference]: Start difference. First operand has 91 places, 123 transitions, 1293 flow. Second operand 7 states and 171 transitions. [2025-02-06 04:29:07,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 250 transitions, 2778 flow [2025-02-06 04:29:07,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 250 transitions, 2577 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-02-06 04:29:07,870 INFO L231 Difference]: Finished difference. Result has 95 places, 145 transitions, 1426 flow [2025-02-06 04:29:07,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1426, PETRI_PLACES=95, PETRI_TRANSITIONS=145} [2025-02-06 04:29:07,871 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 62 predicate places. [2025-02-06 04:29:07,871 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 145 transitions, 1426 flow [2025-02-06 04:29:07,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:07,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:07,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:07,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:29:07,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:07,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2030786800, now seen corresponding path program 5 times [2025-02-06 04:29:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:07,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437764121] [2025-02-06 04:29:07,873 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:29:07,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:07,883 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:29:07,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:29:07,890 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:29:07,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:08,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437764121] [2025-02-06 04:29:08,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437764121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:08,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:08,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:29:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715180557] [2025-02-06 04:29:08,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:08,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:29:08,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:08,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:29:08,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:29:08,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:29:08,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 145 transitions, 1426 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:08,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:08,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:29:08,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:08,610 INFO L124 PetriNetUnfolderBase]: 1095/2350 cut-off events. [2025-02-06 04:29:08,610 INFO L125 PetriNetUnfolderBase]: For 9615/9648 co-relation queries the response was YES. [2025-02-06 04:29:08,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11098 conditions, 2350 events. 1095/2350 cut-off events. For 9615/9648 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15000 event pairs, 296 based on Foata normal form. 27/2366 useless extension candidates. Maximal degree in co-relation 11066. Up to 827 conditions per place. [2025-02-06 04:29:08,635 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 188 selfloop transitions, 53 changer transitions 0/260 dead transitions. [2025-02-06 04:29:08,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 260 transitions, 2833 flow [2025-02-06 04:29:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:29:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:29:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-02-06 04:29:08,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-02-06 04:29:08,637 INFO L175 Difference]: Start difference. First operand has 95 places, 145 transitions, 1426 flow. Second operand 7 states and 168 transitions. [2025-02-06 04:29:08,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 260 transitions, 2833 flow [2025-02-06 04:29:08,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 260 transitions, 2809 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-02-06 04:29:08,676 INFO L231 Difference]: Finished difference. Result has 104 places, 160 transitions, 1764 flow [2025-02-06 04:29:08,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1764, PETRI_PLACES=104, PETRI_TRANSITIONS=160} [2025-02-06 04:29:08,677 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2025-02-06 04:29:08,677 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 160 transitions, 1764 flow [2025-02-06 04:29:08,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:08,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:08,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:29:08,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:08,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash -398753522, now seen corresponding path program 6 times [2025-02-06 04:29:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520791713] [2025-02-06 04:29:08,678 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:29:08,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:08,687 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:29:08,690 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:29:08,693 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:29:08,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:08,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:08,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520791713] [2025-02-06 04:29:08,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520791713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:08,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:08,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:29:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020428886] [2025-02-06 04:29:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:08,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:29:08,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:08,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:29:08,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:29:08,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:29:08,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 160 transitions, 1764 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:08,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:08,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:29:08,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:09,364 INFO L124 PetriNetUnfolderBase]: 1065/2303 cut-off events. [2025-02-06 04:29:09,365 INFO L125 PetriNetUnfolderBase]: For 11847/11884 co-relation queries the response was YES. [2025-02-06 04:29:09,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11406 conditions, 2303 events. 1065/2303 cut-off events. For 11847/11884 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 14607 event pairs, 296 based on Foata normal form. 25/2313 useless extension candidates. Maximal degree in co-relation 11370. Up to 1399 conditions per place. [2025-02-06 04:29:09,394 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 164 selfloop transitions, 50 changer transitions 0/233 dead transitions. [2025-02-06 04:29:09,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 233 transitions, 2777 flow [2025-02-06 04:29:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:29:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:29:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-02-06 04:29:09,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640926640926641 [2025-02-06 04:29:09,396 INFO L175 Difference]: Start difference. First operand has 104 places, 160 transitions, 1764 flow. Second operand 7 states and 166 transitions. [2025-02-06 04:29:09,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 233 transitions, 2777 flow [2025-02-06 04:29:09,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 233 transitions, 2686 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-02-06 04:29:09,443 INFO L231 Difference]: Finished difference. Result has 110 places, 168 transitions, 1927 flow [2025-02-06 04:29:09,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1927, PETRI_PLACES=110, PETRI_TRANSITIONS=168} [2025-02-06 04:29:09,444 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 77 predicate places. [2025-02-06 04:29:09,444 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 168 transitions, 1927 flow [2025-02-06 04:29:09,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:09,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:09,444 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:09,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:29:09,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:09,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash 268800948, now seen corresponding path program 7 times [2025-02-06 04:29:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:09,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616118640] [2025-02-06 04:29:09,445 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:29:09,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:09,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:29:09,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:29:09,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:09,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616118640] [2025-02-06 04:29:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616118640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:29:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744754422] [2025-02-06 04:29:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:09,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:29:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:09,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:29:09,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:29:09,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:09,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 168 transitions, 1927 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06 04:29:09,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:09,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:09,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:10,323 INFO L124 PetriNetUnfolderBase]: 1228/2486 cut-off events. [2025-02-06 04:29:10,324 INFO L125 PetriNetUnfolderBase]: For 12726/12750 co-relation queries the response was YES. [2025-02-06 04:29:10,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12528 conditions, 2486 events. 1228/2486 cut-off events. For 12726/12750 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 14896 event pairs, 340 based on Foata normal form. 13/2492 useless extension candidates. Maximal degree in co-relation 12489. Up to 1854 conditions per place. [2025-02-06 04:29:10,358 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 132 selfloop transitions, 76 changer transitions 0/214 dead transitions. [2025-02-06 04:29:10,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 214 transitions, 2699 flow [2025-02-06 04:29:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:29:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:29:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-02-06 04:29:10,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-02-06 04:29:10,360 INFO L175 Difference]: Start difference. First operand has 110 places, 168 transitions, 1927 flow. Second operand 9 states and 144 transitions. [2025-02-06 04:29:10,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 214 transitions, 2699 flow [2025-02-06 04:29:10,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 214 transitions, 2577 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-02-06 04:29:10,422 INFO L231 Difference]: Finished difference. Result has 118 places, 180 transitions, 2181 flow [2025-02-06 04:29:10,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2181, PETRI_PLACES=118, PETRI_TRANSITIONS=180} [2025-02-06 04:29:10,423 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 85 predicate places. [2025-02-06 04:29:10,423 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 180 transitions, 2181 flow [2025-02-06 04:29:10,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06 04:29:10,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:10,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:10,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:29:10,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:10,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1467667332, now seen corresponding path program 8 times [2025-02-06 04:29:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:10,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303545293] [2025-02-06 04:29:10,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:29:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:10,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:29:10,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:29:10,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:29:10,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:10,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303545293] [2025-02-06 04:29:10,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303545293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:10,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:29:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496954354] [2025-02-06 04:29:10,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:10,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:29:10,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:10,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:29:10,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:29:10,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:29:10,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 180 transitions, 2181 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:10,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:10,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:29:10,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:10,937 INFO L124 PetriNetUnfolderBase]: 947/2056 cut-off events. [2025-02-06 04:29:10,937 INFO L125 PetriNetUnfolderBase]: For 11503/11554 co-relation queries the response was YES. [2025-02-06 04:29:10,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10455 conditions, 2056 events. 947/2056 cut-off events. For 11503/11554 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12996 event pairs, 112 based on Foata normal form. 64/2116 useless extension candidates. Maximal degree in co-relation 10412. Up to 775 conditions per place. [2025-02-06 04:29:10,964 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 163 selfloop transitions, 70 changer transitions 0/250 dead transitions. [2025-02-06 04:29:10,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 250 transitions, 3165 flow [2025-02-06 04:29:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:29:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:29:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-02-06 04:29:10,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2025-02-06 04:29:10,966 INFO L175 Difference]: Start difference. First operand has 118 places, 180 transitions, 2181 flow. Second operand 5 states and 116 transitions. [2025-02-06 04:29:10,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 250 transitions, 3165 flow [2025-02-06 04:29:11,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 250 transitions, 3016 flow, removed 44 selfloop flow, removed 5 redundant places. [2025-02-06 04:29:11,008 INFO L231 Difference]: Finished difference. Result has 119 places, 177 transitions, 2147 flow [2025-02-06 04:29:11,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2147, PETRI_PLACES=119, PETRI_TRANSITIONS=177} [2025-02-06 04:29:11,009 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 86 predicate places. [2025-02-06 04:29:11,009 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 177 transitions, 2147 flow [2025-02-06 04:29:11,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:11,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:11,010 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:11,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:29:11,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:11,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1060770616, now seen corresponding path program 1 times [2025-02-06 04:29:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636411143] [2025-02-06 04:29:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:29:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:11,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:29:11,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:29:11,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:11,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636411143] [2025-02-06 04:29:11,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636411143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:11,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:11,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:29:11,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910530269] [2025-02-06 04:29:11,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:11,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:29:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:11,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:29:11,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:29:11,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:11,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 177 transitions, 2147 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:11,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:11,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:11,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:12,370 INFO L124 PetriNetUnfolderBase]: 2085/4264 cut-off events. [2025-02-06 04:29:12,371 INFO L125 PetriNetUnfolderBase]: For 28370/28430 co-relation queries the response was YES. [2025-02-06 04:29:12,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23324 conditions, 4264 events. 2085/4264 cut-off events. For 28370/28430 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 27634 event pairs, 512 based on Foata normal form. 73/4330 useless extension candidates. Maximal degree in co-relation 23279. Up to 1876 conditions per place. [2025-02-06 04:29:12,423 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 302 selfloop transitions, 177 changer transitions 0/485 dead transitions. [2025-02-06 04:29:12,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 485 transitions, 6306 flow [2025-02-06 04:29:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:29:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:29:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 293 transitions. [2025-02-06 04:29:12,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.527927927927928 [2025-02-06 04:29:12,425 INFO L175 Difference]: Start difference. First operand has 119 places, 177 transitions, 2147 flow. Second operand 15 states and 293 transitions. [2025-02-06 04:29:12,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 485 transitions, 6306 flow [2025-02-06 04:29:12,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 485 transitions, 6012 flow, removed 99 selfloop flow, removed 2 redundant places. [2025-02-06 04:29:12,517 INFO L231 Difference]: Finished difference. Result has 145 places, 323 transitions, 4410 flow [2025-02-06 04:29:12,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4410, PETRI_PLACES=145, PETRI_TRANSITIONS=323} [2025-02-06 04:29:12,518 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places. [2025-02-06 04:29:12,519 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 323 transitions, 4410 flow [2025-02-06 04:29:12,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:12,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:12,519 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:12,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:29:12,519 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:12,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash 51308140, now seen corresponding path program 2 times [2025-02-06 04:29:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733339961] [2025-02-06 04:29:12,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:29:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:12,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:29:12,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:29:12,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:29:12,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733339961] [2025-02-06 04:29:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733339961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:12,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:12,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:29:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64512407] [2025-02-06 04:29:12,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:12,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:29:12,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:12,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:29:12,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:29:12,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:12,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 323 transitions, 4410 flow. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:12,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:12,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:12,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:14,247 INFO L124 PetriNetUnfolderBase]: 2332/4768 cut-off events. [2025-02-06 04:29:14,247 INFO L125 PetriNetUnfolderBase]: For 46092/46116 co-relation queries the response was YES. [2025-02-06 04:29:14,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30051 conditions, 4768 events. 2332/4768 cut-off events. For 46092/46116 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 31712 event pairs, 580 based on Foata normal form. 20/4776 useless extension candidates. Maximal degree in co-relation 29994. Up to 3251 conditions per place. [2025-02-06 04:29:14,291 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 357 selfloop transitions, 169 changer transitions 0/532 dead transitions. [2025-02-06 04:29:14,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 532 transitions, 7657 flow [2025-02-06 04:29:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:29:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 04:29:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 293 transitions. [2025-02-06 04:29:14,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4167852062588905 [2025-02-06 04:29:14,293 INFO L175 Difference]: Start difference. First operand has 145 places, 323 transitions, 4410 flow. Second operand 19 states and 293 transitions. [2025-02-06 04:29:14,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 532 transitions, 7657 flow [2025-02-06 04:29:14,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 532 transitions, 7527 flow, removed 65 selfloop flow, removed 0 redundant places. [2025-02-06 04:29:14,511 INFO L231 Difference]: Finished difference. Result has 177 places, 424 transitions, 6275 flow [2025-02-06 04:29:14,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4354, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6275, PETRI_PLACES=177, PETRI_TRANSITIONS=424} [2025-02-06 04:29:14,513 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 144 predicate places. [2025-02-06 04:29:14,513 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 424 transitions, 6275 flow [2025-02-06 04:29:14,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:14,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:14,514 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:14,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:29:14,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:14,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:14,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1107004928, now seen corresponding path program 3 times [2025-02-06 04:29:14,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:14,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676019123] [2025-02-06 04:29:14,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:29:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:14,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-02-06 04:29:14,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-02-06 04:29:14,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:29:14,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:29:14,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:14,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676019123] [2025-02-06 04:29:14,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676019123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:14,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:14,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:29:14,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833998858] [2025-02-06 04:29:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:14,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:29:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:14,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:29:14,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:29:14,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:14,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 424 transitions, 6275 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:14,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:14,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:14,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:16,179 INFO L124 PetriNetUnfolderBase]: 2506/5098 cut-off events. [2025-02-06 04:29:16,179 INFO L125 PetriNetUnfolderBase]: For 63883/63897 co-relation queries the response was YES. [2025-02-06 04:29:16,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35172 conditions, 5098 events. 2506/5098 cut-off events. For 63883/63897 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 34306 event pairs, 120 based on Foata normal form. 26/5123 useless extension candidates. Maximal degree in co-relation 35101. Up to 1330 conditions per place. [2025-02-06 04:29:16,246 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 254 selfloop transitions, 471 changer transitions 0/731 dead transitions. [2025-02-06 04:29:16,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 731 transitions, 11946 flow [2025-02-06 04:29:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 04:29:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 04:29:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 260 transitions. [2025-02-06 04:29:16,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4133545310015898 [2025-02-06 04:29:16,249 INFO L175 Difference]: Start difference. First operand has 177 places, 424 transitions, 6275 flow. Second operand 17 states and 260 transitions. [2025-02-06 04:29:16,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 731 transitions, 11946 flow [2025-02-06 04:29:16,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 731 transitions, 11595 flow, removed 144 selfloop flow, removed 4 redundant places. [2025-02-06 04:29:16,602 INFO L231 Difference]: Finished difference. Result has 201 places, 634 transitions, 10964 flow [2025-02-06 04:29:16,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6068, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10964, PETRI_PLACES=201, PETRI_TRANSITIONS=634} [2025-02-06 04:29:16,603 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 168 predicate places. [2025-02-06 04:29:16,603 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 634 transitions, 10964 flow [2025-02-06 04:29:16,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:16,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:16,603 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:16,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:29:16,603 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:16,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash 116328288, now seen corresponding path program 4 times [2025-02-06 04:29:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:16,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290381019] [2025-02-06 04:29:16,604 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:29:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:16,614 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-02-06 04:29:16,617 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 20 statements. [2025-02-06 04:29:16,618 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:29:16,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290381019] [2025-02-06 04:29:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290381019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:16,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:16,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:29:16,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267734671] [2025-02-06 04:29:16,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:16,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:29:16,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:16,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:29:16,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:29:16,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:29:16,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 634 transitions, 10964 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:16,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:16,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:29:16,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:17,893 INFO L124 PetriNetUnfolderBase]: 1882/4098 cut-off events. [2025-02-06 04:29:17,893 INFO L125 PetriNetUnfolderBase]: For 67260/67377 co-relation queries the response was YES. [2025-02-06 04:29:17,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31838 conditions, 4098 events. 1882/4098 cut-off events. For 67260/67377 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 28189 event pairs, 145 based on Foata normal form. 145/4211 useless extension candidates. Maximal degree in co-relation 31755. Up to 1532 conditions per place. [2025-02-06 04:29:17,933 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 450 selfloop transitions, 296 changer transitions 0/801 dead transitions. [2025-02-06 04:29:17,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 801 transitions, 15308 flow [2025-02-06 04:29:17,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:29:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:29:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-02-06 04:29:17,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5641891891891891 [2025-02-06 04:29:17,935 INFO L175 Difference]: Start difference. First operand has 201 places, 634 transitions, 10964 flow. Second operand 8 states and 167 transitions. [2025-02-06 04:29:17,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 801 transitions, 15308 flow [2025-02-06 04:29:18,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 801 transitions, 15030 flow, removed 139 selfloop flow, removed 0 redundant places. [2025-02-06 04:29:18,327 INFO L231 Difference]: Finished difference. Result has 210 places, 629 transitions, 11394 flow [2025-02-06 04:29:18,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10697, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11394, PETRI_PLACES=210, PETRI_TRANSITIONS=629} [2025-02-06 04:29:18,328 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 177 predicate places. [2025-02-06 04:29:18,328 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 629 transitions, 11394 flow [2025-02-06 04:29:18,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:18,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:18,328 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:18,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:29:18,328 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:18,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:18,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1093885868, now seen corresponding path program 5 times [2025-02-06 04:29:18,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:18,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802199209] [2025-02-06 04:29:18,329 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:29:18,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:18,339 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:29:18,346 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:29:18,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:29:18,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802199209] [2025-02-06 04:29:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802199209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:18,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:18,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:29:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541795166] [2025-02-06 04:29:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:18,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:29:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:18,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:29:18,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:29:18,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:18,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 629 transitions, 11394 flow. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:18,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:18,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:18,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:21,472 INFO L124 PetriNetUnfolderBase]: 3683/7719 cut-off events. [2025-02-06 04:29:21,473 INFO L125 PetriNetUnfolderBase]: For 140403/140463 co-relation queries the response was YES. [2025-02-06 04:29:21,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62355 conditions, 7719 events. 3683/7719 cut-off events. For 140403/140463 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 57426 event pairs, 491 based on Foata normal form. 97/7801 useless extension candidates. Maximal degree in co-relation 62269. Up to 3409 conditions per place. [2025-02-06 04:29:21,574 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 720 selfloop transitions, 723 changer transitions 23/1472 dead transitions. [2025-02-06 04:29:21,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 1472 transitions, 28738 flow [2025-02-06 04:29:21,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 04:29:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-06 04:29:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 433 transitions. [2025-02-06 04:29:21,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4501039501039501 [2025-02-06 04:29:21,576 INFO L175 Difference]: Start difference. First operand has 210 places, 629 transitions, 11394 flow. Second operand 26 states and 433 transitions. [2025-02-06 04:29:21,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 1472 transitions, 28738 flow [2025-02-06 04:29:22,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 1472 transitions, 27348 flow, removed 68 selfloop flow, removed 5 redundant places. [2025-02-06 04:29:22,697 INFO L231 Difference]: Finished difference. Result has 254 places, 1204 transitions, 24491 flow [2025-02-06 04:29:22,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10412, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=24491, PETRI_PLACES=254, PETRI_TRANSITIONS=1204} [2025-02-06 04:29:22,698 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 221 predicate places. [2025-02-06 04:29:22,699 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 1204 transitions, 24491 flow [2025-02-06 04:29:22,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:22,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:22,699 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:22,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:29:22,699 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:22,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash 419996452, now seen corresponding path program 6 times [2025-02-06 04:29:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:22,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513328007] [2025-02-06 04:29:22,700 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:29:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:22,709 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:29:22,716 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:29:22,716 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:29:22,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:23,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513328007] [2025-02-06 04:29:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513328007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:23,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:23,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:29:23,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754789570] [2025-02-06 04:29:23,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:23,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:29:23,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:23,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:29:23,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:29:23,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:23,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 1204 transitions, 24491 flow. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:23,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:23,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:23,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:27,246 INFO L124 PetriNetUnfolderBase]: 5356/11220 cut-off events. [2025-02-06 04:29:27,246 INFO L125 PetriNetUnfolderBase]: For 248888/248971 co-relation queries the response was YES. [2025-02-06 04:29:27,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98604 conditions, 11220 events. 5356/11220 cut-off events. For 248888/248971 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 88389 event pairs, 925 based on Foata normal form. 44/11245 useless extension candidates. Maximal degree in co-relation 98497. Up to 6080 conditions per place. [2025-02-06 04:29:27,468 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 1245 selfloop transitions, 762 changer transitions 0/2013 dead transitions. [2025-02-06 04:29:27,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 2013 transitions, 44094 flow [2025-02-06 04:29:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 04:29:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 04:29:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 289 transitions. [2025-02-06 04:29:27,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48817567567567566 [2025-02-06 04:29:27,470 INFO L175 Difference]: Start difference. First operand has 254 places, 1204 transitions, 24491 flow. Second operand 16 states and 289 transitions. [2025-02-06 04:29:27,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 2013 transitions, 44094 flow [2025-02-06 04:29:30,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 2013 transitions, 42809 flow, removed 629 selfloop flow, removed 9 redundant places. [2025-02-06 04:29:30,238 INFO L231 Difference]: Finished difference. Result has 274 places, 1699 transitions, 37493 flow [2025-02-06 04:29:30,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=23712, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=37493, PETRI_PLACES=274, PETRI_TRANSITIONS=1699} [2025-02-06 04:29:30,239 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 241 predicate places. [2025-02-06 04:29:30,239 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 1699 transitions, 37493 flow [2025-02-06 04:29:30,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:30,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:30,240 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:30,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:29:30,240 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1331445263, now seen corresponding path program 1 times [2025-02-06 04:29:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:30,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556629831] [2025-02-06 04:29:30,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:29:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:30,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:29:30,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:29:30,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:30,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:30,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:30,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556629831] [2025-02-06 04:29:30,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556629831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:30,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:30,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:29:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357520469] [2025-02-06 04:29:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:30,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:29:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:30,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:29:30,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:29:30,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:29:30,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 1699 transitions, 37493 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:30,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:30,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:29:30,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:35,330 INFO L124 PetriNetUnfolderBase]: 4876/10576 cut-off events. [2025-02-06 04:29:35,331 INFO L125 PetriNetUnfolderBase]: For 269428/269626 co-relation queries the response was YES. [2025-02-06 04:29:35,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98576 conditions, 10576 events. 4876/10576 cut-off events. For 269428/269626 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 86166 event pairs, 997 based on Foata normal form. 16/10529 useless extension candidates. Maximal degree in co-relation 98459. Up to 9052 conditions per place. [2025-02-06 04:29:35,479 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 1503 selfloop transitions, 8 changer transitions 11/1683 dead transitions. [2025-02-06 04:29:35,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1683 transitions, 40056 flow [2025-02-06 04:29:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:29:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:29:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-02-06 04:29:35,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-02-06 04:29:35,480 INFO L175 Difference]: Start difference. First operand has 274 places, 1699 transitions, 37493 flow. Second operand 5 states and 95 transitions. [2025-02-06 04:29:35,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 1683 transitions, 40056 flow [2025-02-06 04:29:38,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1683 transitions, 39090 flow, removed 477 selfloop flow, removed 4 redundant places. [2025-02-06 04:29:38,675 INFO L231 Difference]: Finished difference. Result has 275 places, 1671 transitions, 35933 flow [2025-02-06 04:29:38,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=36021, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=35933, PETRI_PLACES=275, PETRI_TRANSITIONS=1671} [2025-02-06 04:29:38,677 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 242 predicate places. [2025-02-06 04:29:38,677 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 1671 transitions, 35933 flow [2025-02-06 04:29:38,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:38,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:38,678 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:38,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 04:29:38,678 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1379312879, now seen corresponding path program 7 times [2025-02-06 04:29:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:38,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246825813] [2025-02-06 04:29:38,678 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:29:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:38,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:29:38,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:29:38,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:38,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:29:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246825813] [2025-02-06 04:29:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246825813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:29:39,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722977811] [2025-02-06 04:29:39,155 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:29:39,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:29:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:29:39,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:29:39,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:29:39,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:29:39,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:29:39,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:29:39,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:39,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 04:29:39,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:29:39,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 04:29:39,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 04:29:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 04:29:39,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:29:39,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722977811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:39,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:29:39,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2025-02-06 04:29:39,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876820600] [2025-02-06 04:29:39,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:39,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:29:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:39,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:29:39,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:29:39,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-02-06 04:29:39,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 1671 transitions, 35933 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:39,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:39,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-02-06 04:29:39,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:45,397 INFO L124 PetriNetUnfolderBase]: 5552/11966 cut-off events. [2025-02-06 04:29:45,398 INFO L125 PetriNetUnfolderBase]: For 305510/305813 co-relation queries the response was YES. [2025-02-06 04:29:45,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111624 conditions, 11966 events. 5552/11966 cut-off events. For 305510/305813 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 98724 event pairs, 694 based on Foata normal form. 68/11970 useless extension candidates. Maximal degree in co-relation 111507. Up to 4566 conditions per place. [2025-02-06 04:29:45,625 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 916 selfloop transitions, 927 changer transitions 0/2002 dead transitions. [2025-02-06 04:29:45,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 2002 transitions, 46066 flow [2025-02-06 04:29:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 04:29:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 04:29:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 257 transitions. [2025-02-06 04:29:45,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4341216216216216 [2025-02-06 04:29:45,627 INFO L175 Difference]: Start difference. First operand has 275 places, 1671 transitions, 35933 flow. Second operand 16 states and 257 transitions. [2025-02-06 04:29:45,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 2002 transitions, 46066 flow [2025-02-06 04:29:49,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 2002 transitions, 45495 flow, removed 76 selfloop flow, removed 11 redundant places. [2025-02-06 04:29:49,428 INFO L231 Difference]: Finished difference. Result has 283 places, 1860 transitions, 42280 flow [2025-02-06 04:29:49,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=35429, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=762, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=846, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=42280, PETRI_PLACES=283, PETRI_TRANSITIONS=1860} [2025-02-06 04:29:49,430 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 250 predicate places. [2025-02-06 04:29:49,430 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 1860 transitions, 42280 flow [2025-02-06 04:29:49,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:49,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:29:49,431 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:29:49,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:29:49,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:29:49,635 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:29:49,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:29:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1204847347, now seen corresponding path program 8 times [2025-02-06 04:29:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:29:49,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417583287] [2025-02-06 04:29:49,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:29:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:29:49,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:29:49,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 25 statements. [2025-02-06 04:29:49,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:29:49,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:29:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:29:49,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:29:49,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417583287] [2025-02-06 04:29:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417583287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:29:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:29:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:29:49,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237162836] [2025-02-06 04:29:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:29:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:29:49,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:29:49,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:29:49,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:29:49,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:29:49,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 1860 transitions, 42280 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:29:49,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:29:49,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:29:49,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:29:57,216 INFO L124 PetriNetUnfolderBase]: 6986/14506 cut-off events. [2025-02-06 04:29:57,216 INFO L125 PetriNetUnfolderBase]: For 393717/393866 co-relation queries the response was YES. [2025-02-06 04:29:57,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140064 conditions, 14506 events. 6986/14506 cut-off events. For 393717/393866 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 118631 event pairs, 618 based on Foata normal form. 28/14486 useless extension candidates. Maximal degree in co-relation 139944. Up to 4169 conditions per place. [2025-02-06 04:29:57,508 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 1040 selfloop transitions, 1274 changer transitions 0/2320 dead transitions. [2025-02-06 04:29:57,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 2320 transitions, 56776 flow [2025-02-06 04:29:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:29:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:29:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2025-02-06 04:29:57,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43843843843843844 [2025-02-06 04:29:57,509 INFO L175 Difference]: Start difference. First operand has 283 places, 1860 transitions, 42280 flow. Second operand 9 states and 146 transitions. [2025-02-06 04:29:57,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 2320 transitions, 56776 flow [2025-02-06 04:30:02,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 2320 transitions, 55970 flow, removed 306 selfloop flow, removed 3 redundant places. [2025-02-06 04:30:02,947 INFO L231 Difference]: Finished difference. Result has 293 places, 2125 transitions, 52334 flow [2025-02-06 04:30:02,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=41508, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=52334, PETRI_PLACES=293, PETRI_TRANSITIONS=2125} [2025-02-06 04:30:02,949 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 260 predicate places. [2025-02-06 04:30:02,949 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 2125 transitions, 52334 flow [2025-02-06 04:30:02,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:30:02,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:02,950 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:30:02,950 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:30:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1949179955, now seen corresponding path program 9 times [2025-02-06 04:30:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3628361] [2025-02-06 04:30:02,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:30:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:02,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:30:02,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 25 statements. [2025-02-06 04:30:02,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:30:02,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:30:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:03,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3628361] [2025-02-06 04:30:03,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3628361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:03,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:03,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:30:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286900913] [2025-02-06 04:30:03,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:03,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:30:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:03,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:30:03,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:30:03,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:30:03,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 2125 transitions, 52334 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:30:03,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:03,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:30:03,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:11,472 INFO L124 PetriNetUnfolderBase]: 7261/15025 cut-off events. [2025-02-06 04:30:11,473 INFO L125 PetriNetUnfolderBase]: For 465276/465496 co-relation queries the response was YES. [2025-02-06 04:30:11,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154307 conditions, 15025 events. 7261/15025 cut-off events. For 465276/465496 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 123696 event pairs, 517 based on Foata normal form. 88/15070 useless extension candidates. Maximal degree in co-relation 154182. Up to 5374 conditions per place. [2025-02-06 04:30:11,705 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 1018 selfloop transitions, 1259 changer transitions 0/2283 dead transitions. [2025-02-06 04:30:11,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 2283 transitions, 60089 flow [2025-02-06 04:30:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:30:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:30:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-02-06 04:30:11,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-02-06 04:30:11,707 INFO L175 Difference]: Start difference. First operand has 293 places, 2125 transitions, 52334 flow. Second operand 9 states and 144 transitions. [2025-02-06 04:30:11,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 2283 transitions, 60089 flow [2025-02-06 04:30:18,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 2283 transitions, 59253 flow, removed 110 selfloop flow, removed 4 redundant places. [2025-02-06 04:30:18,320 INFO L231 Difference]: Finished difference. Result has 303 places, 2197 transitions, 57668 flow [2025-02-06 04:30:18,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=51562, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=57668, PETRI_PLACES=303, PETRI_TRANSITIONS=2197} [2025-02-06 04:30:18,322 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 270 predicate places. [2025-02-06 04:30:18,322 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 2197 transitions, 57668 flow [2025-02-06 04:30:18,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:30:18,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:18,322 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:18,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:30:18,322 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:30:18,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1450220605, now seen corresponding path program 10 times [2025-02-06 04:30:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:18,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276416423] [2025-02-06 04:30:18,323 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:30:18,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:18,332 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-06 04:30:18,335 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 25 statements. [2025-02-06 04:30:18,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:30:18,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:30:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276416423] [2025-02-06 04:30:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276416423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:18,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:18,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:30:18,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073971744] [2025-02-06 04:30:18,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:18,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:30:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:18,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:30:18,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:30:18,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 04:30:18,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 2197 transitions, 57668 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:30:18,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:18,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 04:30:18,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:20,944 INFO L124 PetriNetUnfolderBase]: 1618/4202 cut-off events. [2025-02-06 04:30:20,944 INFO L125 PetriNetUnfolderBase]: For 151273/151499 co-relation queries the response was YES. [2025-02-06 04:30:20,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46320 conditions, 4202 events. 1618/4202 cut-off events. For 151273/151499 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 32154 event pairs, 201 based on Foata normal form. 188/4380 useless extension candidates. Maximal degree in co-relation 46191. Up to 1688 conditions per place. [2025-02-06 04:30:21,004 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 811 selfloop transitions, 372 changer transitions 9/1282 dead transitions. [2025-02-06 04:30:21,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 1282 transitions, 37202 flow [2025-02-06 04:30:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:30:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:30:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-02-06 04:30:21,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-02-06 04:30:21,005 INFO L175 Difference]: Start difference. First operand has 303 places, 2197 transitions, 57668 flow. Second operand 5 states and 95 transitions. [2025-02-06 04:30:21,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 1282 transitions, 37202 flow [2025-02-06 04:30:22,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 1282 transitions, 28078 flow, removed 379 selfloop flow, removed 53 redundant places. [2025-02-06 04:30:22,029 INFO L231 Difference]: Finished difference. Result has 248 places, 1258 transitions, 26131 flow [2025-02-06 04:30:22,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=25220, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=359, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=26131, PETRI_PLACES=248, PETRI_TRANSITIONS=1258} [2025-02-06 04:30:22,031 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 215 predicate places. [2025-02-06 04:30:22,031 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 1258 transitions, 26131 flow [2025-02-06 04:30:22,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:30:22,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:22,031 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:22,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 04:30:22,031 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:30:22,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -551303977, now seen corresponding path program 1 times [2025-02-06 04:30:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:22,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649875667] [2025-02-06 04:30:22,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:22,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:30:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:30:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:22,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649875667] [2025-02-06 04:30:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649875667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991288129] [2025-02-06 04:30:22,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:22,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:22,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:22,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:30:22,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:30:22,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:30:22,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:30:22,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:22,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:22,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 04:30:22,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:22,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 04:30:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:22,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:22,946 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-02-06 04:30:22,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 55 [2025-02-06 04:30:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:23,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991288129] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:23,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:23,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-02-06 04:30:23,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904765460] [2025-02-06 04:30:23,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:23,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 04:30:23,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:23,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 04:30:23,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-02-06 04:30:23,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 04:30:23,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 1258 transitions, 26131 flow. Second operand has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 24 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:30:23,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:23,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 04:30:23,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:25,092 INFO L124 PetriNetUnfolderBase]: 1783/4528 cut-off events. [2025-02-06 04:30:25,093 INFO L125 PetriNetUnfolderBase]: For 90811/90899 co-relation queries the response was YES. [2025-02-06 04:30:25,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39691 conditions, 4528 events. 1783/4528 cut-off events. For 90811/90899 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 34515 event pairs, 85 based on Foata normal form. 165/4692 useless extension candidates. Maximal degree in co-relation 39597. Up to 1140 conditions per place. [2025-02-06 04:30:25,139 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 0 selfloop transitions, 0 changer transitions 1540/1540 dead transitions. [2025-02-06 04:30:25,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1540 transitions, 34500 flow [2025-02-06 04:30:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 04:30:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 04:30:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 290 transitions. [2025-02-06 04:30:25,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3407755581668625 [2025-02-06 04:30:25,141 INFO L175 Difference]: Start difference. First operand has 248 places, 1258 transitions, 26131 flow. Second operand 23 states and 290 transitions. [2025-02-06 04:30:25,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 1540 transitions, 34500 flow [2025-02-06 04:30:25,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 1540 transitions, 33086 flow, removed 130 selfloop flow, removed 5 redundant places. [2025-02-06 04:30:25,804 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2025-02-06 04:30:25,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=23360, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=0, PETRI_PLACES=263, PETRI_TRANSITIONS=0} [2025-02-06 04:30:25,805 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 230 predicate places. [2025-02-06 04:30:25,805 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2025-02-06 04:30:25,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 24 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:30:25,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 04:30:25,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-06 04:30:25,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-06 04:30:25,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-06 04:30:25,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-06 04:30:25,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:30:26,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:26,009 INFO L422 BasicCegarLoop]: Path program histogram: [10, 8, 1, 1, 1, 1, 1] [2025-02-06 04:30:26,013 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:30:26,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:30:26,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:30:26 BasicIcfg [2025-02-06 04:30:26,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:30:26,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:30:26,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:30:26,019 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:30:26,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:29:02" (3/4) ... [2025-02-06 04:30:26,020 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 04:30:26,023 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-02-06 04:30:26,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-02-06 04:30:26,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 04:30:26,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-06 04:30:26,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 04:30:26,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 04:30:26,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:30:26,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:30:26,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:30:26,103 INFO L158 Benchmark]: Toolchain (without parser) took 84194.50ms. Allocated memory was 142.6MB in the beginning and 10.2GB in the end (delta: 10.0GB). Free memory was 105.8MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-02-06 04:30:26,103 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:30:26,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.32ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 85.7MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:30:26,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.65ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 83.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:30:26,104 INFO L158 Benchmark]: Boogie Preprocessor took 36.16ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:30:26,105 INFO L158 Benchmark]: IcfgBuilder took 536.63ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 50.3MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:30:26,105 INFO L158 Benchmark]: TraceAbstraction took 83096.60ms. Allocated memory was 142.6MB in the beginning and 10.2GB in the end (delta: 10.0GB). Free memory was 49.4MB in the beginning and 7.5GB in the end (delta: -7.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2025-02-06 04:30:26,106 INFO L158 Benchmark]: Witness Printer took 83.59ms. Allocated memory is still 10.2GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:30:26,107 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.84ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.32ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 85.7MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.65ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 83.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.16ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 536.63ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 50.3MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 83096.60ms. Allocated memory was 142.6MB in the beginning and 10.2GB in the end (delta: 10.0GB). Free memory was 49.4MB in the beginning and 7.5GB in the end (delta: -7.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 83.59ms. Allocated memory is still 10.2GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 54 locations, 5 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: 83.0s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 75.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2026 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2001 mSDsluCounter, 545 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6624 IncrementalHoareTripleChecker+Invalid, 6807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 55 mSDtfsCounter, 6624 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57668occurred in iteration=21, InterpolantAutomatonStates: 249, 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.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 466 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 468 ConstructedInterpolants, 5 QuantifiedInterpolants, 3905 SizeOfPredicates, 29 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 27/47 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 04:30:26,125 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