./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:36:43,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:36:43,436 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:36:43,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:36:43,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:36:43,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:36:43,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:36:43,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:36:43,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:36:43,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:36:43,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:36:43,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:36:43,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:36:43,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:36:43,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:36:43,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:36:43,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:36:43,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:36:43,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:36:43,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:36:43,457 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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2025-02-06 04:36:43,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:36:43,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:36:43,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:36:43,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:36:43,655 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:36:43,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2025-02-06 04:36:44,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec9ca2a6b/2fb52502c9cf4d0da8e9f861b654935b/FLAG5bb4dd6c5 [2025-02-06 04:36:45,053 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:36:45,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2025-02-06 04:36:45,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec9ca2a6b/2fb52502c9cf4d0da8e9f861b654935b/FLAG5bb4dd6c5 [2025-02-06 04:36:45,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec9ca2a6b/2fb52502c9cf4d0da8e9f861b654935b [2025-02-06 04:36:45,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:36:45,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:36:45,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:36:45,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:36:45,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:36:45,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45, skipping insertion in model container [2025-02-06 04:36:45,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:36:45,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2257,2270] [2025-02-06 04:36:45,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:36:45,292 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:36:45,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2257,2270] [2025-02-06 04:36:45,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:36:45,319 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:36:45,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45 WrapperNode [2025-02-06 04:36:45,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:36:45,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:36:45,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:36:45,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:36:45,326 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:36:45" (1/1) ... [2025-02-06 04:36:45,331 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:36:45" (1/1) ... [2025-02-06 04:36:45,350 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-02-06 04:36:45,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:36:45,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:36:45,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:36:45,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:36:45,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,372 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:36:45,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:36:45,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:36:45,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:36:45,385 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:36:45,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (1/1) ... [2025-02-06 04:36:45,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:36:45,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:45,414 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:36:45,422 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:36:45,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:36:45,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:36:45,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:36:45,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:36:45,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:36:45,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:36:45,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:36:45,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:36:45,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:36:45,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:36:45,439 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:36:45,507 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:36:45,508 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:36:45,621 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:36:45,622 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:36:45,697 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:36:45,697 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:36:45,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:45 BoogieIcfgContainer [2025-02-06 04:36:45,698 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:36:45,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:36:45,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:36:45,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:36:45,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:36:45" (1/3) ... [2025-02-06 04:36:45,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cc934b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:45, skipping insertion in model container [2025-02-06 04:36:45,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45" (2/3) ... [2025-02-06 04:36:45,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cc934b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:45, skipping insertion in model container [2025-02-06 04:36:45,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:45" (3/3) ... [2025-02-06 04:36:45,705 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2025-02-06 04:36:45,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:36:45,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 37 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 04:36:45,716 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:36:45,749 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:36:45,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 101 flow [2025-02-06 04:36:45,795 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2025-02-06 04:36:45,797 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:36:45,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 4/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-02-06 04:36:45,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 101 flow [2025-02-06 04:36:45,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2025-02-06 04:36:45,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:36:45,823 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;@25680996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:36:45,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:36:45,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:36:45,833 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2025-02-06 04:36:45,833 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:36:45,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:45,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:45,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:45,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:45,838 INFO L85 PathProgramCache]: Analyzing trace with hash 542328260, now seen corresponding path program 1 times [2025-02-06 04:36:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427813495] [2025-02-06 04:36:45,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:45,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:36:45,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:36:45,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:45,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:46,285 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:36:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427813495] [2025-02-06 04:36:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427813495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763012471] [2025-02-06 04:36:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:46,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:46,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:46,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2025-02-06 04:36:46,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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:36:46,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:46,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2025-02-06 04:36:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:46,554 INFO L124 PetriNetUnfolderBase]: 585/1084 cut-off events. [2025-02-06 04:36:46,554 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-06 04:36:46,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 1084 events. 585/1084 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6157 event pairs, 76 based on Foata normal form. 68/1045 useless extension candidates. Maximal degree in co-relation 1766. Up to 469 conditions per place. [2025-02-06 04:36:46,562 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 43 selfloop transitions, 8 changer transitions 1/66 dead transitions. [2025-02-06 04:36:46,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 278 flow [2025-02-06 04:36:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-02-06 04:36:46,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.705 [2025-02-06 04:36:46,571 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 90 flow. Second operand 5 states and 141 transitions. [2025-02-06 04:36:46,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 278 flow [2025-02-06 04:36:46,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:36:46,577 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 133 flow [2025-02-06 04:36:46,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-02-06 04:36:46,580 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2025-02-06 04:36:46,580 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 133 flow [2025-02-06 04:36:46,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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:36:46,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:46,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:46,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:36:46,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:46,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash -928615382, now seen corresponding path program 2 times [2025-02-06 04:36:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574156994] [2025-02-06 04:36:46,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:46,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:36:46,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:36:46,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:36:46,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:46,663 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:36:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:46,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574156994] [2025-02-06 04:36:46,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574156994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:46,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:46,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:36:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701007988] [2025-02-06 04:36:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:46,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:36:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:46,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:36:46,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:36:46,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-02-06 04:36:46,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:46,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:46,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-02-06 04:36:46,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:46,807 INFO L124 PetriNetUnfolderBase]: 852/1442 cut-off events. [2025-02-06 04:36:46,807 INFO L125 PetriNetUnfolderBase]: For 1069/1069 co-relation queries the response was YES. [2025-02-06 04:36:46,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1442 events. 852/1442 cut-off events. For 1069/1069 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7899 event pairs, 252 based on Foata normal form. 109/1455 useless extension candidates. Maximal degree in co-relation 1942. Up to 834 conditions per place. [2025-02-06 04:36:46,814 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 34 selfloop transitions, 5 changer transitions 1/52 dead transitions. [2025-02-06 04:36:46,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 252 flow [2025-02-06 04:36:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:36:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:36:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-02-06 04:36:46,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 04:36:46,815 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 133 flow. Second operand 3 states and 80 transitions. [2025-02-06 04:36:46,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 252 flow [2025-02-06 04:36:46,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:46,818 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 160 flow [2025-02-06 04:36:46,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-02-06 04:36:46,818 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-02-06 04:36:46,819 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 160 flow [2025-02-06 04:36:46,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:46,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:46,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:46,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:36:46,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1539945036, now seen corresponding path program 1 times [2025-02-06 04:36:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:46,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026631982] [2025-02-06 04:36:46,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:46,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:36:46,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:36:46,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:46,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:46,874 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:36:46,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:46,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026631982] [2025-02-06 04:36:46,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026631982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:46,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:46,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:36:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925465790] [2025-02-06 04:36:46,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:46,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:36:46,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:46,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:36:46,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:36:46,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-02-06 04:36:46,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:46,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:46,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-02-06 04:36:46,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:47,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([214] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [60#(<= 1 (mod ~v_assert~0 256)), 17#L56true, 33#L42true, 15#L71true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 22#L88-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2025-02-06 04:36:47,010 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,010 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-06 04:36:47,010 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,010 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-06 04:36:47,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L71true, Black: 51#(<= 0 ~pos~0), 14#L55true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, 63#true, 22#L88-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2025-02-06 04:36:47,024 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,024 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,024 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,024 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [60#(<= 1 (mod ~v_assert~0 256)), 15#L71true, 14#L55true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 22#L88-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,025 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,025 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,025 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,025 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([214] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [60#(<= 1 (mod ~v_assert~0 256)), 17#L56true, 15#L71true, 33#L42true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 6#L89true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2025-02-06 04:36:47,029 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,029 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,029 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,029 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([214] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [60#(<= 1 (mod ~v_assert~0 256)), 17#L56true, 30#thread3EXITtrue, 33#L42true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 22#L88-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2025-02-06 04:36:47,029 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,029 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,029 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,029 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L71true, Black: 51#(<= 0 ~pos~0), 14#L55true, 28#L43true, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 6#L89true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2025-02-06 04:36:47,040 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,040 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,041 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,041 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), 14#L55true, 28#L43true, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 22#L88-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2025-02-06 04:36:47,041 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,041 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,041 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,041 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [60#(<= 1 (mod ~v_assert~0 256)), 15#L71true, 14#L55true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 6#L89true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,042 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,042 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,042 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,042 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 14#L55true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 22#L88-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,043 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,043 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,043 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,043 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([214] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 17#L56true, 33#L42true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 6#L89true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2025-02-06 04:36:47,047 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,047 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,047 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,047 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [60#(<= 1 (mod ~v_assert~0 256)), 15#L71true, Black: 51#(<= 0 ~pos~0), 14#L55true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,054 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([214] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [60#(<= 1 (mod ~v_assert~0 256)), 17#L56true, 33#L42true, 15#L71true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true]) [2025-02-06 04:36:47,054 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L71true, Black: 51#(<= 0 ~pos~0), 14#L55true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true]) [2025-02-06 04:36:47,054 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,054 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,055 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), 14#L55true, 28#L43true, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 6#L89true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2025-02-06 04:36:47,059 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,059 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,059 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,059 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 14#L55true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 6#L89true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,060 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,060 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,060 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,060 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [60#(<= 1 (mod ~v_assert~0 256)), 15#L71true, Black: 51#(<= 0 ~pos~0), 14#L55true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,069 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([214] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [60#(<= 1 (mod ~v_assert~0 256)), 17#L56true, 33#L42true, 15#L71true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true]) [2025-02-06 04:36:47,069 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L71true, 14#L55true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true]) [2025-02-06 04:36:47,069 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,069 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 14#L55true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,070 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 04:36:47,070 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,070 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,070 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 14#L55true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true]) [2025-02-06 04:36:47,070 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 04:36:47,070 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,070 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,070 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][14], [65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 26#L57-1true, 15#L71true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true]) [2025-02-06 04:36:47,076 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,076 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,076 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,076 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][14], [65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 26#L57-1true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true]) [2025-02-06 04:36:47,076 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,076 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,076 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,076 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][14], [65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 8#L62true, 15#L71true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true]) [2025-02-06 04:36:47,077 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,077 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,077 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,077 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][14], [65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 8#L62true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true]) [2025-02-06 04:36:47,077 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,077 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,077 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,077 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][34], [65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 26#L57-1true, 15#L71true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,078 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][34], [65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 26#L57-1true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,078 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][34], [65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 8#L62true, 15#L71true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,078 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,078 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-06 04:36:47,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][34], [60#(<= 1 (mod ~v_assert~0 256)), 65#(<= 1 (mod ~d2~0 256)), 30#thread3EXITtrue, 8#L62true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 22#L88-1true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,079 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,079 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,079 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,079 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 14#L55true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,080 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-02-06 04:36:47,080 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,080 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,081 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 14#L55true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true]) [2025-02-06 04:36:47,081 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-02-06 04:36:47,081 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,081 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,081 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-06 04:36:47,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][14], [60#(<= 1 (mod ~v_assert~0 256)), 65#(<= 1 (mod ~d2~0 256)), 8#L62true, 15#L71true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true]) [2025-02-06 04:36:47,084 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,084 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,084 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,084 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([208] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][14], [60#(<= 1 (mod ~v_assert~0 256)), 65#(<= 1 (mod ~d2~0 256)), 30#thread3EXITtrue, 8#L62true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L43true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true]) [2025-02-06 04:36:47,085 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][34], [60#(<= 1 (mod ~v_assert~0 256)), 65#(<= 1 (mod ~d2~0 256)), 8#L62true, 15#L71true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,085 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([209] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][34], [65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 30#thread3EXITtrue, 8#L62true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 6#L89true, Black: 58#true, 10#L46true]) [2025-02-06 04:36:47,085 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,085 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-06 04:36:47,089 INFO L124 PetriNetUnfolderBase]: 1793/2944 cut-off events. [2025-02-06 04:36:47,089 INFO L125 PetriNetUnfolderBase]: For 2533/2631 co-relation queries the response was YES. [2025-02-06 04:36:47,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 2944 events. 1793/2944 cut-off events. For 2533/2631 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 17694 event pairs, 664 based on Foata normal form. 0/2404 useless extension candidates. Maximal degree in co-relation 4324. Up to 1201 conditions per place. [2025-02-06 04:36:47,106 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 44 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-02-06 04:36:47,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 328 flow [2025-02-06 04:36:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:36:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:36:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-02-06 04:36:47,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-02-06 04:36:47,108 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 160 flow. Second operand 3 states and 82 transitions. [2025-02-06 04:36:47,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 328 flow [2025-02-06 04:36:47,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:36:47,112 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 172 flow [2025-02-06 04:36:47,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-02-06 04:36:47,113 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-02-06 04:36:47,113 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 172 flow [2025-02-06 04:36:47,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:47,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:47,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:47,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:36:47,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:47,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash 488500467, now seen corresponding path program 1 times [2025-02-06 04:36:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792277911] [2025-02-06 04:36:47,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:36:47,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:36:47,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:47,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:47,181 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:36:47,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:47,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792277911] [2025-02-06 04:36:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792277911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:47,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:47,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:36:47,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368994910] [2025-02-06 04:36:47,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:47,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:36:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:47,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:36:47,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:36:47,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-02-06 04:36:47,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:47,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:47,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-02-06 04:36:47,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:47,453 INFO L124 PetriNetUnfolderBase]: 2028/3433 cut-off events. [2025-02-06 04:36:47,453 INFO L125 PetriNetUnfolderBase]: For 2213/2271 co-relation queries the response was YES. [2025-02-06 04:36:47,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8470 conditions, 3433 events. 2028/3433 cut-off events. For 2213/2271 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21350 event pairs, 815 based on Foata normal form. 0/3020 useless extension candidates. Maximal degree in co-relation 4916. Up to 1484 conditions per place. [2025-02-06 04:36:47,473 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 44 selfloop transitions, 3 changer transitions 2/64 dead transitions. [2025-02-06 04:36:47,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 345 flow [2025-02-06 04:36:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:36:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:36:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-06 04:36:47,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-02-06 04:36:47,474 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 172 flow. Second operand 3 states and 84 transitions. [2025-02-06 04:36:47,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 345 flow [2025-02-06 04:36:47,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:36:47,482 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 182 flow [2025-02-06 04:36:47,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-02-06 04:36:47,482 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2025-02-06 04:36:47,482 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 182 flow [2025-02-06 04:36:47,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:47,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:47,483 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:36:47,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:47,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash -108366190, now seen corresponding path program 1 times [2025-02-06 04:36:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:47,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45920912] [2025-02-06 04:36:47,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:47,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:36:47,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:36:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:47,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45920912] [2025-02-06 04:36:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45920912] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098008470] [2025-02-06 04:36:47,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:47,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:47,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:47,669 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:36:47,671 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:36:47,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:36:47,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:36:47,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:47,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:47,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:36:47,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:47,841 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:36:47,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098008470] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:47,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:47,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2025-02-06 04:36:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038317173] [2025-02-06 04:36:47,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:47,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:36:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:47,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:36:47,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:36:47,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-02-06 04:36:47,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 182 flow. Second operand has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 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:36:47,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:47,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-02-06 04:36:47,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:48,424 INFO L124 PetriNetUnfolderBase]: 2897/5356 cut-off events. [2025-02-06 04:36:48,424 INFO L125 PetriNetUnfolderBase]: For 4231/4275 co-relation queries the response was YES. [2025-02-06 04:36:48,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13792 conditions, 5356 events. 2897/5356 cut-off events. For 4231/4275 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 37221 event pairs, 211 based on Foata normal form. 160/5263 useless extension candidates. Maximal degree in co-relation 9218. Up to 1219 conditions per place. [2025-02-06 04:36:48,447 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 55 selfloop transitions, 20 changer transitions 21/112 dead transitions. [2025-02-06 04:36:48,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 112 transitions, 617 flow [2025-02-06 04:36:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:36:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:36:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2025-02-06 04:36:48,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-02-06 04:36:48,450 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 182 flow. Second operand 9 states and 222 transitions. [2025-02-06 04:36:48,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 112 transitions, 617 flow [2025-02-06 04:36:48,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:36:48,458 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 359 flow [2025-02-06 04:36:48,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2025-02-06 04:36:48,460 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2025-02-06 04:36:48,460 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 359 flow [2025-02-06 04:36:48,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 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:36:48,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:48,460 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:48,472 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:36:48,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:48,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:48,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1359471515, now seen corresponding path program 1 times [2025-02-06 04:36:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:48,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237464745] [2025-02-06 04:36:48,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:48,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:48,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:36:48,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:36:48,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:48,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:48,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237464745] [2025-02-06 04:36:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237464745] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721908039] [2025-02-06 04:36:48,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:48,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:48,811 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:36:48,812 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:36:48,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:36:48,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:36:48,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:48,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:48,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:36:48,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:48,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721908039] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:48,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2025-02-06 04:36:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922228666] [2025-02-06 04:36:48,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:48,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:36:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:48,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:36:48,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:36:48,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-02-06 04:36:48,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 359 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 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:36:48,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:48,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-02-06 04:36:48,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:49,531 INFO L124 PetriNetUnfolderBase]: 3702/7077 cut-off events. [2025-02-06 04:36:49,531 INFO L125 PetriNetUnfolderBase]: For 17161/17243 co-relation queries the response was YES. [2025-02-06 04:36:49,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22595 conditions, 7077 events. 3702/7077 cut-off events. For 17161/17243 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 53542 event pairs, 235 based on Foata normal form. 206/6850 useless extension candidates. Maximal degree in co-relation 18841. Up to 1827 conditions per place. [2025-02-06 04:36:49,563 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 62 selfloop transitions, 26 changer transitions 60/164 dead transitions. [2025-02-06 04:36:49,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 164 transitions, 1306 flow [2025-02-06 04:36:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:36:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:36:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2025-02-06 04:36:49,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615 [2025-02-06 04:36:49,565 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 359 flow. Second operand 10 states and 246 transitions. [2025-02-06 04:36:49,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 164 transitions, 1306 flow [2025-02-06 04:36:49,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 164 transitions, 1145 flow, removed 79 selfloop flow, removed 3 redundant places. [2025-02-06 04:36:49,589 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 526 flow [2025-02-06 04:36:49,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=526, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2025-02-06 04:36:49,590 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2025-02-06 04:36:49,590 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 526 flow [2025-02-06 04:36:49,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 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:36:49,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:49,590 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:49,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:36:49,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:49,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:49,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash 300627786, now seen corresponding path program 2 times [2025-02-06 04:36:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:49,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805813250] [2025-02-06 04:36:49,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:49,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 04:36:49,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 04:36:49,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:36:49,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:49,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805813250] [2025-02-06 04:36:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805813250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:49,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:49,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200454923] [2025-02-06 04:36:49,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:49,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:49,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:49,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:49,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:49,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-02-06 04:36:49,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:36:49,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:49,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-02-06 04:36:49,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:50,296 INFO L124 PetriNetUnfolderBase]: 3325/6023 cut-off events. [2025-02-06 04:36:50,297 INFO L125 PetriNetUnfolderBase]: For 21736/22921 co-relation queries the response was YES. [2025-02-06 04:36:50,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21910 conditions, 6023 events. 3325/6023 cut-off events. For 21736/22921 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 43097 event pairs, 1105 based on Foata normal form. 142/5277 useless extension candidates. Maximal degree in co-relation 21177. Up to 1749 conditions per place. [2025-02-06 04:36:50,394 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 100 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2025-02-06 04:36:50,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 121 transitions, 1124 flow [2025-02-06 04:36:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:36:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:36:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-06 04:36:50,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-02-06 04:36:50,395 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 526 flow. Second operand 4 states and 112 transitions. [2025-02-06 04:36:50,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 121 transitions, 1124 flow [2025-02-06 04:36:50,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 121 transitions, 1043 flow, removed 38 selfloop flow, removed 4 redundant places. [2025-02-06 04:36:50,428 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 525 flow [2025-02-06 04:36:50,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=525, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2025-02-06 04:36:50,428 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2025-02-06 04:36:50,428 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 525 flow [2025-02-06 04:36:50,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:36:50,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:50,429 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:50,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:36:50,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:50,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash 365192626, now seen corresponding path program 2 times [2025-02-06 04:36:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:50,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272113409] [2025-02-06 04:36:50,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:50,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:36:50,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:36:50,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:36:50,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:36:50,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272113409] [2025-02-06 04:36:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272113409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:50,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:50,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:36:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375497955] [2025-02-06 04:36:50,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:50,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:36:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:50,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:36:50,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:36:50,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-02-06 04:36:50,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 525 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:36:50,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:50,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-02-06 04:36:50,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:51,078 INFO L124 PetriNetUnfolderBase]: 2881/5423 cut-off events. [2025-02-06 04:36:51,079 INFO L125 PetriNetUnfolderBase]: For 17722/18197 co-relation queries the response was YES. [2025-02-06 04:36:51,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20053 conditions, 5423 events. 2881/5423 cut-off events. For 17722/18197 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 37441 event pairs, 858 based on Foata normal form. 61/4975 useless extension candidates. Maximal degree in co-relation 15529. Up to 1656 conditions per place. [2025-02-06 04:36:51,105 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 92 selfloop transitions, 5 changer transitions 2/117 dead transitions. [2025-02-06 04:36:51,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 117 transitions, 1004 flow [2025-02-06 04:36:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:36:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:36:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-02-06 04:36:51,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69375 [2025-02-06 04:36:51,106 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 525 flow. Second operand 4 states and 111 transitions. [2025-02-06 04:36:51,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 117 transitions, 1004 flow [2025-02-06 04:36:51,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 117 transitions, 990 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:51,120 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 537 flow [2025-02-06 04:36:51,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=537, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2025-02-06 04:36:51,121 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2025-02-06 04:36:51,121 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 537 flow [2025-02-06 04:36:51,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:36:51,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:51,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:51,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:36:51,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:51,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:51,122 INFO L85 PathProgramCache]: Analyzing trace with hash -823675533, now seen corresponding path program 1 times [2025-02-06 04:36:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:51,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160945609] [2025-02-06 04:36:51,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:51,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:51,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 04:36:51,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 04:36:51,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:51,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:36:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160945609] [2025-02-06 04:36:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160945609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:36:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228882476] [2025-02-06 04:36:51,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:51,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:51,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:36:51,271 INFO L229 MonitoredProcess]: Starting monitored process 4 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:36:51,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:36:51,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 04:36:51,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 04:36:51,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:51,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:51,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 04:36:51,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:36:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:36:51,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:36:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:36:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228882476] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:36:51,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:36:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2025-02-06 04:36:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751581209] [2025-02-06 04:36:51,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:36:51,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:36:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:51,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:36:51,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:36:51,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2025-02-06 04:36:51,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 537 flow. Second operand has 12 states, 12 states have (on average 16.166666666666668) internal successors, (194), 12 states have internal predecessors, (194), 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:36:51,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:51,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2025-02-06 04:36:51,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:52,951 INFO L124 PetriNetUnfolderBase]: 9335/16607 cut-off events. [2025-02-06 04:36:52,952 INFO L125 PetriNetUnfolderBase]: For 53679/53743 co-relation queries the response was YES. [2025-02-06 04:36:53,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63442 conditions, 16607 events. 9335/16607 cut-off events. For 53679/53743 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 125500 event pairs, 883 based on Foata normal form. 324/16843 useless extension candidates. Maximal degree in co-relation 47072. Up to 3336 conditions per place. [2025-02-06 04:36:53,033 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 98 selfloop transitions, 56 changer transitions 119/286 dead transitions. [2025-02-06 04:36:53,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 286 transitions, 2540 flow [2025-02-06 04:36:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 04:36:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 04:36:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 352 transitions. [2025-02-06 04:36:53,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 04:36:53,038 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 537 flow. Second operand 16 states and 352 transitions. [2025-02-06 04:36:53,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 286 transitions, 2540 flow [2025-02-06 04:36:53,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 286 transitions, 2540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:36:53,112 INFO L231 Difference]: Finished difference. Result has 100 places, 108 transitions, 1099 flow [2025-02-06 04:36:53,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1099, PETRI_PLACES=100, PETRI_TRANSITIONS=108} [2025-02-06 04:36:53,112 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2025-02-06 04:36:53,112 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 108 transitions, 1099 flow [2025-02-06 04:36:53,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.166666666666668) internal successors, (194), 12 states have internal predecessors, (194), 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:36:53,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:53,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:36:53,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:36:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:36:53,320 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:53,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -278322647, now seen corresponding path program 2 times [2025-02-06 04:36:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36552697] [2025-02-06 04:36:53,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:36:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:53,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-06 04:36:53,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 40 statements. [2025-02-06 04:36:53,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:36:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:36:53,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:53,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36552697] [2025-02-06 04:36:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36552697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:53,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:53,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:36:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457310868] [2025-02-06 04:36:53,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:53,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:36:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:53,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:36:53,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:36:53,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2025-02-06 04:36:53,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 108 transitions, 1099 flow. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 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:36:53,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:53,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2025-02-06 04:36:53,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:54,134 INFO L124 PetriNetUnfolderBase]: 1757/4801 cut-off events. [2025-02-06 04:36:54,135 INFO L125 PetriNetUnfolderBase]: For 37631/38622 co-relation queries the response was YES. [2025-02-06 04:36:54,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20776 conditions, 4801 events. 1757/4801 cut-off events. For 37631/38622 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 42524 event pairs, 309 based on Foata normal form. 616/5199 useless extension candidates. Maximal degree in co-relation 20719. Up to 963 conditions per place. [2025-02-06 04:36:54,154 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 0 selfloop transitions, 0 changer transitions 185/185 dead transitions. [2025-02-06 04:36:54,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 185 transitions, 2172 flow [2025-02-06 04:36:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:36:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:36:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-02-06 04:36:54,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6045454545454545 [2025-02-06 04:36:54,156 INFO L175 Difference]: Start difference. First operand has 100 places, 108 transitions, 1099 flow. Second operand 11 states and 266 transitions. [2025-02-06 04:36:54,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 185 transitions, 2172 flow [2025-02-06 04:36:54,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 185 transitions, 1917 flow, removed 77 selfloop flow, removed 13 redundant places. [2025-02-06 04:36:54,188 INFO L231 Difference]: Finished difference. Result has 86 places, 0 transitions, 0 flow [2025-02-06 04:36:54,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=86, PETRI_TRANSITIONS=0} [2025-02-06 04:36:54,190 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2025-02-06 04:36:54,190 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 0 transitions, 0 flow [2025-02-06 04:36:54,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 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:36:54,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-02-06 04:36:54,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-02-06 04:36:54,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-06 04:36:54,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-06 04:36:54,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:36:54,193 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2025-02-06 04:36:54,195 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:36:54,195 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:36:54,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:36:54 BasicIcfg [2025-02-06 04:36:54,199 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:36:54,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:36:54,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:36:54,200 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:36:54,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:45" (3/4) ... [2025-02-06 04:36:54,202 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 04:36:54,204 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 04:36:54,204 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 04:36:54,204 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 04:36:54,206 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 04:36:54,206 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 04:36:54,206 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 04:36:54,206 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 04:36:54,253 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:36:54,254 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:36:54,254 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:36:54,254 INFO L158 Benchmark]: Toolchain (without parser) took 9130.24ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 106.1MB in the beginning and 496.3MB in the end (delta: -390.2MB). Peak memory consumption was 301.6MB. Max. memory is 16.1GB. [2025-02-06 04:36:54,255 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:36:54,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.77ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:36:54,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.42ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:36:54,255 INFO L158 Benchmark]: Boogie Preprocessor took 33.77ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.3MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:36:54,255 INFO L158 Benchmark]: IcfgBuilder took 312.39ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 70.4MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:36:54,255 INFO L158 Benchmark]: TraceAbstraction took 8500.05ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 69.4MB in the beginning and 500.5MB in the end (delta: -431.1MB). Peak memory consumption was 662.3MB. Max. memory is 16.1GB. [2025-02-06 04:36:54,255 INFO L158 Benchmark]: Witness Printer took 54.45ms. Allocated memory is still 838.9MB. Free memory was 500.5MB in the beginning and 496.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:36:54,256 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.77ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.42ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.77ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.3MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 312.39ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 70.4MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8500.05ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 69.4MB in the beginning and 500.5MB in the end (delta: -431.1MB). Peak memory consumption was 662.3MB. Max. memory is 16.1GB. * Witness Printer took 54.45ms. Allocated memory is still 838.9MB. Free memory was 500.5MB in the beginning and 496.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 60 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.4s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 561 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1408 IncrementalHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 12 mSDtfsCounter, 1408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 203 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1099occurred in iteration=9, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 412 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310 SizeOfPredicates, 17 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 33/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 04:36:54,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE