./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive.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 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:20:02,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:20:02,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:20:02,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:20:02,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:20:02,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:20:02,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:20:02,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:20:02,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:20:02,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:20:02,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:20:02,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:20:02,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:20:02,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:20:02,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:20:02,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:20:02,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:20:02,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:20:02,410 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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2025-02-08 01:20:02,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:20:02,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:20:02,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:20:02,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:20:02,871 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:20:02,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-02-08 01:20:04,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfb234df3/07eafd30df2a49fca65b4bb184d69730/FLAGe48274d29 [2025-02-08 01:20:04,350 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:20:04,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-02-08 01:20:04,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfb234df3/07eafd30df2a49fca65b4bb184d69730/FLAGe48274d29 [2025-02-08 01:20:04,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfb234df3/07eafd30df2a49fca65b4bb184d69730 [2025-02-08 01:20:04,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:20:04,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:20:04,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:20:04,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:20:04,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:20:04,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6704c0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04, skipping insertion in model container [2025-02-08 01:20:04,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:20:04,542 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/popl20-send-receive.wvr.c[3146,3159] [2025-02-08 01:20:04,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:20:04,561 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:20:04,587 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/popl20-send-receive.wvr.c[3146,3159] [2025-02-08 01:20:04,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:20:04,607 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:20:04,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04 WrapperNode [2025-02-08 01:20:04,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:20:04,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:20:04,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:20:04,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:20:04,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,636 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 139 [2025-02-08 01:20:04,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:20:04,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:20:04,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:20:04,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:20:04,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,654 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 01:20:04,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:20:04,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:20:04,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:20:04,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:20:04,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (1/1) ... [2025-02-08 01:20:04,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:20:04,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:04,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:20:04,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:20:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:20:04,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:20:04,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:20:04,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:20:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:20:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:20:04,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:20:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:20:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:20:04,704 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:20:04,769 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:20:04,771 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:20:05,019 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:20:05,020 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:20:05,193 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:20:05,194 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:20:05,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:20:05 BoogieIcfgContainer [2025-02-08 01:20:05,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:20:05,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:20:05,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:20:05,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:20:05,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:20:04" (1/3) ... [2025-02-08 01:20:05,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671f79e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:20:05, skipping insertion in model container [2025-02-08 01:20:05,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:04" (2/3) ... [2025-02-08 01:20:05,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671f79e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:20:05, skipping insertion in model container [2025-02-08 01:20:05,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:20:05" (3/3) ... [2025-02-08 01:20:05,205 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-02-08 01:20:05,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:20:05,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 01:20:05,217 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:20:05,266 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:20:05,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2025-02-08 01:20:05,328 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-02-08 01:20:05,331 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:20:05,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 4/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-02-08 01:20:05,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2025-02-08 01:20:05,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2025-02-08 01:20:05,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:20:05,362 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;@6da65062, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:20:05,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:20:05,374 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:20:05,374 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-02-08 01:20:05,374 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:20:05,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:05,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:05,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:05,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash 813894826, now seen corresponding path program 1 times [2025-02-08 01:20:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836240224] [2025-02-08 01:20:05,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:05,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:20:05,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:20:05,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:05,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:05,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836240224] [2025-02-08 01:20:05,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836240224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:05,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:05,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:20:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365837487] [2025-02-08 01:20:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:05,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:20:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:05,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:20:05,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:20:05,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-08 01:20:05,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:05,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:05,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-08 01:20:05,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:06,250 INFO L124 PetriNetUnfolderBase]: 627/1033 cut-off events. [2025-02-08 01:20:06,251 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-08 01:20:06,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 1033 events. 627/1033 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4645 event pairs, 66 based on Foata normal form. 100/1073 useless extension candidates. Maximal degree in co-relation 1956. Up to 350 conditions per place. [2025-02-08 01:20:06,257 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 56 selfloop transitions, 4 changer transitions 5/72 dead transitions. [2025-02-08 01:20:06,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 72 transitions, 304 flow [2025-02-08 01:20:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:20:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:20:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-02-08 01:20:06,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-02-08 01:20:06,265 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 5 states and 117 transitions. [2025-02-08 01:20:06,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 72 transitions, 304 flow [2025-02-08 01:20:06,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 72 transitions, 284 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:20:06,270 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 90 flow [2025-02-08 01:20:06,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-02-08 01:20:06,273 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2025-02-08 01:20:06,274 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 90 flow [2025-02-08 01:20:06,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:06,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:06,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:06,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:20:06,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:06,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1222190587, now seen corresponding path program 1 times [2025-02-08 01:20:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:06,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097678019] [2025-02-08 01:20:06,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:06,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:20:06,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:20:06,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:06,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097678019] [2025-02-08 01:20:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097678019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:06,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:06,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:20:06,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914902801] [2025-02-08 01:20:06,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:06,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:20:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:06,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:20:06,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:20:06,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-08 01:20:06,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:06,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:06,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-08 01:20:06,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:06,403 INFO L124 PetriNetUnfolderBase]: 329/567 cut-off events. [2025-02-08 01:20:06,403 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-02-08 01:20:06,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 567 events. 329/567 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2082 event pairs, 140 based on Foata normal form. 21/527 useless extension candidates. Maximal degree in co-relation 480. Up to 407 conditions per place. [2025-02-08 01:20:06,407 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 30 selfloop transitions, 3 changer transitions 1/41 dead transitions. [2025-02-08 01:20:06,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 178 flow [2025-02-08 01:20:06,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:20:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:20:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-02-08 01:20:06,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-02-08 01:20:06,408 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 90 flow. Second operand 3 states and 64 transitions. [2025-02-08 01:20:06,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 178 flow [2025-02-08 01:20:06,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:20:06,410 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 105 flow [2025-02-08 01:20:06,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-02-08 01:20:06,410 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-02-08 01:20:06,410 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 105 flow [2025-02-08 01:20:06,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:06,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:06,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:06,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:20:06,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:06,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1273952539, now seen corresponding path program 1 times [2025-02-08 01:20:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:06,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668208004] [2025-02-08 01:20:06,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:06,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:20:06,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:20:06,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:06,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:06,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668208004] [2025-02-08 01:20:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668208004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:06,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:06,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:20:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885839387] [2025-02-08 01:20:06,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:06,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:20:06,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:06,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:20:06,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:20:06,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-08 01:20:06,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:06,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:06,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-08 01:20:06,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:06,653 INFO L124 PetriNetUnfolderBase]: 364/634 cut-off events. [2025-02-08 01:20:06,654 INFO L125 PetriNetUnfolderBase]: For 283/283 co-relation queries the response was YES. [2025-02-08 01:20:06,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 634 events. 364/634 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2428 event pairs, 263 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 705. Up to 499 conditions per place. [2025-02-08 01:20:06,659 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 27 selfloop transitions, 2 changer transitions 11/47 dead transitions. [2025-02-08 01:20:06,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 214 flow [2025-02-08 01:20:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:20:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:20:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-08 01:20:06,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-08 01:20:06,661 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 105 flow. Second operand 4 states and 78 transitions. [2025-02-08 01:20:06,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 214 flow [2025-02-08 01:20:06,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:06,662 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 116 flow [2025-02-08 01:20:06,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-02-08 01:20:06,663 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-02-08 01:20:06,663 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 116 flow [2025-02-08 01:20:06,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:06,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:06,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:06,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:20:06,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:06,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash 179286552, now seen corresponding path program 1 times [2025-02-08 01:20:06,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:06,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722165656] [2025-02-08 01:20:06,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:06,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:06,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:20:06,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:20:06,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:06,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:20:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722165656] [2025-02-08 01:20:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722165656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:06,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:06,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:20:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774750642] [2025-02-08 01:20:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:20:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:06,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:20:06,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:20:06,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-08 01:20:06,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:06,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:06,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-08 01:20:06,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:06,933 INFO L124 PetriNetUnfolderBase]: 287/492 cut-off events. [2025-02-08 01:20:06,933 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2025-02-08 01:20:06,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 492 events. 287/492 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1681 event pairs, 54 based on Foata normal form. 24/499 useless extension candidates. Maximal degree in co-relation 1198. Up to 200 conditions per place. [2025-02-08 01:20:06,937 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 37 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-02-08 01:20:06,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 229 flow [2025-02-08 01:20:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:20:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:20:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-08 01:20:06,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2025-02-08 01:20:06,938 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 116 flow. Second operand 4 states and 77 transitions. [2025-02-08 01:20:06,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 229 flow [2025-02-08 01:20:06,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 221 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 01:20:06,940 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 120 flow [2025-02-08 01:20:06,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-02-08 01:20:06,941 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-02-08 01:20:06,941 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 120 flow [2025-02-08 01:20:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:06,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:06,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:06,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:20:06,942 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1267367952, now seen corresponding path program 2 times [2025-02-08 01:20:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112221038] [2025-02-08 01:20:06,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:20:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:06,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:20:06,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:20:06,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:20:06,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:20:07,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112221038] [2025-02-08 01:20:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112221038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:07,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:07,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:20:07,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196357190] [2025-02-08 01:20:07,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:07,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:20:07,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:07,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:20:07,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:20:07,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-08 01:20:07,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:07,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:07,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-08 01:20:07,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:07,195 INFO L124 PetriNetUnfolderBase]: 359/615 cut-off events. [2025-02-08 01:20:07,195 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2025-02-08 01:20:07,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 615 events. 359/615 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2232 event pairs, 22 based on Foata normal form. 16/619 useless extension candidates. Maximal degree in co-relation 1467. Up to 199 conditions per place. [2025-02-08 01:20:07,198 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 54 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-02-08 01:20:07,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 321 flow [2025-02-08 01:20:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:20:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:20:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-02-08 01:20:07,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2025-02-08 01:20:07,199 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 120 flow. Second operand 5 states and 103 transitions. [2025-02-08 01:20:07,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 321 flow [2025-02-08 01:20:07,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 313 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:20:07,201 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 130 flow [2025-02-08 01:20:07,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-08 01:20:07,201 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2025-02-08 01:20:07,201 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 130 flow [2025-02-08 01:20:07,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:07,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:07,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:07,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:20:07,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:07,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1640011286, now seen corresponding path program 3 times [2025-02-08 01:20:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:07,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242711934] [2025-02-08 01:20:07,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:20:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:07,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:20:07,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:20:07,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:20:07,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:07,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:07,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242711934] [2025-02-08 01:20:07,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242711934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:07,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:07,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:20:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606915709] [2025-02-08 01:20:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:07,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:20:07,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:07,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:20:07,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:20:07,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-02-08 01:20:07,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:07,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:07,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-02-08 01:20:07,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:07,634 INFO L124 PetriNetUnfolderBase]: 1346/2136 cut-off events. [2025-02-08 01:20:07,634 INFO L125 PetriNetUnfolderBase]: For 1045/1045 co-relation queries the response was YES. [2025-02-08 01:20:07,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5349 conditions, 2136 events. 1346/2136 cut-off events. For 1045/1045 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9979 event pairs, 217 based on Foata normal form. 30/2107 useless extension candidates. Maximal degree in co-relation 5327. Up to 728 conditions per place. [2025-02-08 01:20:07,645 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 82 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2025-02-08 01:20:07,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 100 transitions, 540 flow [2025-02-08 01:20:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:20:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:20:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-02-08 01:20:07,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342592592592593 [2025-02-08 01:20:07,647 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 130 flow. Second operand 6 states and 137 transitions. [2025-02-08 01:20:07,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 100 transitions, 540 flow [2025-02-08 01:20:07,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 528 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:20:07,650 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 223 flow [2025-02-08 01:20:07,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-02-08 01:20:07,651 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2025-02-08 01:20:07,651 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 223 flow [2025-02-08 01:20:07,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:07,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:07,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:07,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:20:07,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:07,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1528690274, now seen corresponding path program 4 times [2025-02-08 01:20:07,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562978892] [2025-02-08 01:20:07,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:20:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:07,658 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:20:07,666 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:20:07,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:20:07,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562978892] [2025-02-08 01:20:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562978892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160832229] [2025-02-08 01:20:07,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:20:07,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:07,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:07,789 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-08 01:20:07,791 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-08 01:20:07,832 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:20:07,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:20:07,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:20:07,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:07,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:20:07,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:07,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:20:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160832229] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:20:08,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:20:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-02-08 01:20:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817155898] [2025-02-08 01:20:08,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:20:08,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:20:08,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:08,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:20:08,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:20:08,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-02-08 01:20:08,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 223 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:08,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:08,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-02-08 01:20:08,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:08,706 INFO L124 PetriNetUnfolderBase]: 3035/4514 cut-off events. [2025-02-08 01:20:08,706 INFO L125 PetriNetUnfolderBase]: For 4506/4506 co-relation queries the response was YES. [2025-02-08 01:20:08,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13208 conditions, 4514 events. 3035/4514 cut-off events. For 4506/4506 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21542 event pairs, 76 based on Foata normal form. 206/4527 useless extension candidates. Maximal degree in co-relation 13183. Up to 848 conditions per place. [2025-02-08 01:20:08,724 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 134 selfloop transitions, 40 changer transitions 49/226 dead transitions. [2025-02-08 01:20:08,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 226 transitions, 1359 flow [2025-02-08 01:20:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 01:20:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 01:20:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 330 transitions. [2025-02-08 01:20:08,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-02-08 01:20:08,725 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 223 flow. Second operand 22 states and 330 transitions. [2025-02-08 01:20:08,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 226 transitions, 1359 flow [2025-02-08 01:20:08,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 226 transitions, 1359 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:20:08,733 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 554 flow [2025-02-08 01:20:08,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=554, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-02-08 01:20:08,734 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2025-02-08 01:20:08,734 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 554 flow [2025-02-08 01:20:08,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:08,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:08,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:08,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:20:08,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:08,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:08,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash -311264020, now seen corresponding path program 5 times [2025-02-08 01:20:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:08,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426645076] [2025-02-08 01:20:08,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:20:08,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:08,943 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:20:08,955 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:20:08,955 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:08,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:09,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426645076] [2025-02-08 01:20:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426645076] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024199364] [2025-02-08 01:20:09,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:20:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:09,497 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-08 01:20:09,500 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-08 01:20:09,535 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:20:09,568 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:20:09,568 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:09,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 01:20:09,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:09,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 01:20:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:09,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:20:10,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-02-08 01:20:10,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:20:10,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-02-08 01:20:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024199364] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:20:10,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:20:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-02-08 01:20:10,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586196057] [2025-02-08 01:20:10,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:20:10,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 01:20:10,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:10,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 01:20:10,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-02-08 01:20:10,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-02-08 01:20:10,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 554 flow. Second operand has 29 states, 29 states have (on average 8.413793103448276) internal successors, (244), 29 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:10,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:10,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-02-08 01:20:10,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:14,813 INFO L124 PetriNetUnfolderBase]: 14310/21785 cut-off events. [2025-02-08 01:20:14,813 INFO L125 PetriNetUnfolderBase]: For 115694/115694 co-relation queries the response was YES. [2025-02-08 01:20:14,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88929 conditions, 21785 events. 14310/21785 cut-off events. For 115694/115694 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 138060 event pairs, 1242 based on Foata normal form. 1512/23295 useless extension candidates. Maximal degree in co-relation 81129. Up to 3099 conditions per place. [2025-02-08 01:20:14,916 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 358 selfloop transitions, 119 changer transitions 347/827 dead transitions. [2025-02-08 01:20:14,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 827 transitions, 7867 flow [2025-02-08 01:20:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-08 01:20:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-02-08 01:20:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 701 transitions. [2025-02-08 01:20:14,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4528423772609819 [2025-02-08 01:20:14,919 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 554 flow. Second operand 43 states and 701 transitions. [2025-02-08 01:20:14,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 827 transitions, 7867 flow [2025-02-08 01:20:15,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 827 transitions, 7753 flow, removed 53 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:15,128 INFO L231 Difference]: Finished difference. Result has 159 places, 181 transitions, 1728 flow [2025-02-08 01:20:15,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1728, PETRI_PLACES=159, PETRI_TRANSITIONS=181} [2025-02-08 01:20:15,129 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 121 predicate places. [2025-02-08 01:20:15,129 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 181 transitions, 1728 flow [2025-02-08 01:20:15,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.413793103448276) internal successors, (244), 29 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:15,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:15,129 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 01:20:15,135 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-08 01:20:15,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:15,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:15,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1619028249, now seen corresponding path program 6 times [2025-02-08 01:20:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:15,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127563059] [2025-02-08 01:20:15,331 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:20:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:15,337 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:20:15,354 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-02-08 01:20:15,355 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:20:15,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:20:15,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:15,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127563059] [2025-02-08 01:20:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127563059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:20:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118657951] [2025-02-08 01:20:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:15,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:20:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:15,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:20:15,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:20:15,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-08 01:20:15,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 181 transitions, 1728 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:15,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:15,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-08 01:20:15,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:16,640 INFO L124 PetriNetUnfolderBase]: 5082/8766 cut-off events. [2025-02-08 01:20:16,640 INFO L125 PetriNetUnfolderBase]: For 174486/174668 co-relation queries the response was YES. [2025-02-08 01:20:16,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47931 conditions, 8766 events. 5082/8766 cut-off events. For 174486/174668 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 60271 event pairs, 846 based on Foata normal form. 246/8748 useless extension candidates. Maximal degree in co-relation 44303. Up to 2588 conditions per place. [2025-02-08 01:20:16,698 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 160 selfloop transitions, 41 changer transitions 48/280 dead transitions. [2025-02-08 01:20:16,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 280 transitions, 3171 flow [2025-02-08 01:20:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:20:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:20:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2025-02-08 01:20:16,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-02-08 01:20:16,703 INFO L175 Difference]: Start difference. First operand has 159 places, 181 transitions, 1728 flow. Second operand 8 states and 158 transitions. [2025-02-08 01:20:16,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 280 transitions, 3171 flow [2025-02-08 01:20:16,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 280 transitions, 2888 flow, removed 86 selfloop flow, removed 10 redundant places. [2025-02-08 01:20:16,971 INFO L231 Difference]: Finished difference. Result has 157 places, 188 transitions, 1706 flow [2025-02-08 01:20:16,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1706, PETRI_PLACES=157, PETRI_TRANSITIONS=188} [2025-02-08 01:20:16,974 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 119 predicate places. [2025-02-08 01:20:16,974 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 188 transitions, 1706 flow [2025-02-08 01:20:16,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:16,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:16,974 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] [2025-02-08 01:20:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:20:16,975 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-08 01:20:16,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1394506276, now seen corresponding path program 7 times [2025-02-08 01:20:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106700022] [2025-02-08 01:20:16,975 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:20:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:16,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 01:20:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 01:20:16,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:16,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:20:17,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:17,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106700022] [2025-02-08 01:20:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106700022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:17,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:17,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:20:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791610276] [2025-02-08 01:20:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:17,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:20:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:17,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:20:17,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:20:17,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-08 01:20:17,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 188 transitions, 1706 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:17,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:17,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-08 01:20:17,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:18,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L84-->L70: Formula: (= (ite (= (mod v_~v_assert~0_14 256) 0) 0 1) |v_thread2Thread1of1ForFork0_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_14} OutVars{~v_assert~0=v_~v_assert~0_14, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1#1][159], [658#true, 86#(and (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< 0 |thread2Thread1of1ForFork0_~cond~1#1|) (= (mod ~v_assert~0 256) 0))), Black: 655#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 653#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 96#true, 27#thread3EXITtrue, 637#true, Black: 299#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 305#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 295#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 53#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 412#(= |thread1Thread1of1ForFork1_~cond~0#1| 1), Black: 297#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 303#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), Black: 301#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 309#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 60#(<= ~back~0 ~front~0), Black: 160#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 98#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 206#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 293#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 307#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 285#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 287#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 74#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 579#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 90#(and (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (< 0 |thread2Thread1of1ForFork0_~cond~1#1|)) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< 0 |thread2Thread1of1ForFork0_~cond~1#1|) (= (mod ~v_assert~0 256) 0))), Black: 88#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 543#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 553#(and (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~n~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 87#(and (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (< 0 |thread2Thread1of1ForFork0_~cond~1#1|)) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 561#(and (<= (+ ~back~0 1) ~n~0) (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 595#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 551#(and (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 37#L112-1true, Black: 585#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 539#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 541#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 589#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 36#L70true, Black: 569#(and (= ~sum~0 1) (= ~v_assert~0 1) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 577#(and (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 535#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 1)), Black: 555#(and (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~n~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 5#L52true, Black: 557#(and (<= (+ ~back~0 1) ~n~0) (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 567#(and (<= 0 ~sum~0) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 559#(and (or (< ~back~0 0) (and (or (and (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (< 0 (+ ~queue~0.offset 1))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 537#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 571#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (< 0 (+ ~queue~0.offset 1))) (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 545#(and (<= (+ ~back~0 1) ~n~0) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))), Black: 581#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 527#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 547#(and (<= (+ ~back~0 1) ~n~0) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 531#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))), Black: 549#(and (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 563#(and (= ~v_assert~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))]) [2025-02-08 01:20:18,627 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-02-08 01:20:18,627 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-02-08 01:20:18,627 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-02-08 01:20:18,627 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-02-08 01:20:18,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L84-->L70: Formula: (= (ite (= (mod v_~v_assert~0_14 256) 0) 0 1) |v_thread2Thread1of1ForFork0_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_14} OutVars{~v_assert~0=v_~v_assert~0_14, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1#1][159], [658#true, 86#(and (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< 0 |thread2Thread1of1ForFork0_~cond~1#1|) (= (mod ~v_assert~0 256) 0))), Black: 655#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 653#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 96#true, 27#thread3EXITtrue, 637#true, Black: 299#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 305#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 295#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 12#L113true, Black: 53#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 412#(= |thread1Thread1of1ForFork1_~cond~0#1| 1), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 297#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 303#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), Black: 301#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 60#(<= ~back~0 ~front~0), Black: 309#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 160#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 98#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 206#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 293#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 307#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 285#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 287#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 74#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 579#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 90#(and (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (< 0 |thread2Thread1of1ForFork0_~cond~1#1|)) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (< 0 |thread2Thread1of1ForFork0_~cond~1#1|) (= (mod ~v_assert~0 256) 0))), Black: 543#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 88#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 553#(and (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~n~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 87#(and (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (< 0 |thread2Thread1of1ForFork0_~cond~1#1|)) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 561#(and (<= (+ ~back~0 1) ~n~0) (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 595#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 551#(and (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 585#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 539#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 541#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))))) (= ~sum~0 0) (<= ~front~0 ~back~0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 589#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 36#L70true, Black: 569#(and (= ~sum~0 1) (= ~v_assert~0 1) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 577#(and (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 535#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 1)), Black: 555#(and (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~n~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 5#L52true, Black: 557#(and (<= (+ ~back~0 1) ~n~0) (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 567#(and (<= 0 ~sum~0) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 559#(and (or (< ~back~0 0) (and (or (and (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (< 0 (+ ~queue~0.offset 1))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (< ~n~0 (+ ~back~0 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 537#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 ~queue~0.offset) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))))) (= ~sum~0 0) (<= ~front~0 ~back~0) (<= ~n~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 571#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (< 0 (+ ~queue~0.offset 1))) (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 545#(and (<= (+ ~back~0 1) ~n~0) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))), Black: 581#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 527#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 547#(and (<= (+ ~back~0 1) ~n~0) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~back~0 ~front~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 531#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))), Black: 549#(and (exists ((v_~back~0_112 Int)) (and (<= 0 v_~back~0_112) (<= (+ v_~back~0_112 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (+ (* v_~back~0_112 4) ~queue~0.offset)) 1))) (<= 0 ~queue~0.offset) (= ~v_assert~0 1) (= ~sum~0 0) (<= ~front~0 ~back~0) (or (= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 563#(and (= ~v_assert~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))]) [2025-02-08 01:20:18,674 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-02-08 01:20:18,674 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-02-08 01:20:18,674 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-02-08 01:20:18,674 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-02-08 01:20:18,906 INFO L124 PetriNetUnfolderBase]: 7880/13889 cut-off events. [2025-02-08 01:20:18,907 INFO L125 PetriNetUnfolderBase]: For 175220/175566 co-relation queries the response was YES. [2025-02-08 01:20:18,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74049 conditions, 13889 events. 7880/13889 cut-off events. For 175220/175566 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 102211 event pairs, 2229 based on Foata normal form. 336/13892 useless extension candidates. Maximal degree in co-relation 66673. Up to 6301 conditions per place. [2025-02-08 01:20:19,013 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 240 selfloop transitions, 39 changer transitions 1/311 dead transitions. [2025-02-08 01:20:19,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 311 transitions, 3490 flow [2025-02-08 01:20:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:20:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:20:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-08 01:20:19,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-08 01:20:19,014 INFO L175 Difference]: Start difference. First operand has 157 places, 188 transitions, 1706 flow. Second operand 4 states and 99 transitions. [2025-02-08 01:20:19,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 311 transitions, 3490 flow [2025-02-08 01:20:19,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 311 transitions, 3392 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-02-08 01:20:19,204 INFO L231 Difference]: Finished difference. Result has 158 places, 219 transitions, 2071 flow [2025-02-08 01:20:19,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2071, PETRI_PLACES=158, PETRI_TRANSITIONS=219} [2025-02-08 01:20:19,205 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 120 predicate places. [2025-02-08 01:20:19,205 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 219 transitions, 2071 flow [2025-02-08 01:20:19,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:19,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:19,206 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-08 01:20:19,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:20:19,206 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash -645383030, now seen corresponding path program 8 times [2025-02-08 01:20:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131234077] [2025-02-08 01:20:19,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:20:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:19,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 01:20:19,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:20:19,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:19,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:20:19,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131234077] [2025-02-08 01:20:19,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131234077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:19,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:19,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:20:19,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122598316] [2025-02-08 01:20:19,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:19,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:20:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:19,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:20:19,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:20:19,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-08 01:20:19,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 219 transitions, 2071 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:19,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:19,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-08 01:20:19,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:21,083 INFO L124 PetriNetUnfolderBase]: 10347/17062 cut-off events. [2025-02-08 01:20:21,083 INFO L125 PetriNetUnfolderBase]: For 208540/208630 co-relation queries the response was YES. [2025-02-08 01:20:21,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93955 conditions, 17062 events. 10347/17062 cut-off events. For 208540/208630 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 113646 event pairs, 2853 based on Foata normal form. 1074/18009 useless extension candidates. Maximal degree in co-relation 85369. Up to 8717 conditions per place. [2025-02-08 01:20:21,209 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 182 selfloop transitions, 14 changer transitions 3/205 dead transitions. [2025-02-08 01:20:21,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 205 transitions, 2428 flow [2025-02-08 01:20:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:20:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:20:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-08 01:20:21,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-08 01:20:21,211 INFO L175 Difference]: Start difference. First operand has 158 places, 219 transitions, 2071 flow. Second operand 4 states and 78 transitions. [2025-02-08 01:20:21,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 205 transitions, 2428 flow [2025-02-08 01:20:21,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 205 transitions, 2354 flow, removed 35 selfloop flow, removed 8 redundant places. [2025-02-08 01:20:21,493 INFO L231 Difference]: Finished difference. Result has 143 places, 153 transitions, 1525 flow [2025-02-08 01:20:21,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1525, PETRI_PLACES=143, PETRI_TRANSITIONS=153} [2025-02-08 01:20:21,494 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2025-02-08 01:20:21,494 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 153 transitions, 1525 flow [2025-02-08 01:20:21,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:21,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:21,495 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-02-08 01:20:21,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:20:21,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:21,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash -395800418, now seen corresponding path program 1 times [2025-02-08 01:20:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:21,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362184364] [2025-02-08 01:20:21,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:21,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 01:20:21,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:20:21,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:21,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:22,481 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-08 01:20:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362184364] [2025-02-08 01:20:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362184364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055310818] [2025-02-08 01:20:22,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:22,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:22,484 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-08 01:20:22,492 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-08 01:20:22,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 01:20:22,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:20:22,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:22,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:22,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 01:20:22,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:23,136 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-08 01:20:23,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:20:23,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:20:23,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-02-08 01:20:23,878 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-08 01:20:23,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055310818] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:20:23,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:20:23,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2025-02-08 01:20:23,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426851796] [2025-02-08 01:20:23,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:20:23,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-08 01:20:23,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:23,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-08 01:20:23,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2025-02-08 01:20:23,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-08 01:20:23,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 153 transitions, 1525 flow. Second operand has 41 states, 41 states have (on average 9.292682926829269) internal successors, (381), 41 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:23,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:23,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-08 01:20:23,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:40,582 INFO L124 PetriNetUnfolderBase]: 52936/85690 cut-off events. [2025-02-08 01:20:40,583 INFO L125 PetriNetUnfolderBase]: For 902082/902378 co-relation queries the response was YES. [2025-02-08 01:20:41,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460111 conditions, 85690 events. 52936/85690 cut-off events. For 902082/902378 co-relation queries the response was YES. Maximal size of possible extension queue 1492. Compared 676144 event pairs, 6474 based on Foata normal form. 1328/86588 useless extension candidates. Maximal degree in co-relation 442405. Up to 12667 conditions per place. [2025-02-08 01:20:41,262 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 1057 selfloop transitions, 552 changer transitions 678/2293 dead transitions. [2025-02-08 01:20:41,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 2293 transitions, 26531 flow [2025-02-08 01:20:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-02-08 01:20:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2025-02-08 01:20:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 1964 transitions. [2025-02-08 01:20:41,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.466286799620133 [2025-02-08 01:20:41,267 INFO L175 Difference]: Start difference. First operand has 143 places, 153 transitions, 1525 flow. Second operand 117 states and 1964 transitions. [2025-02-08 01:20:41,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 2293 transitions, 26531 flow [2025-02-08 01:20:42,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 2293 transitions, 26091 flow, removed 217 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:42,417 INFO L231 Difference]: Finished difference. Result has 313 places, 702 transitions, 9234 flow [2025-02-08 01:20:42,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=117, PETRI_FLOW=9234, PETRI_PLACES=313, PETRI_TRANSITIONS=702} [2025-02-08 01:20:42,418 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 275 predicate places. [2025-02-08 01:20:42,418 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 702 transitions, 9234 flow [2025-02-08 01:20:42,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.292682926829269) internal successors, (381), 41 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:42,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:42,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-02-08 01:20:42,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:20:42,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:42,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:42,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1449058604, now seen corresponding path program 2 times [2025-02-08 01:20:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:42,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678801577] [2025-02-08 01:20:42,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:20:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:42,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 01:20:42,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:20:42,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:42,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:43,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:43,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678801577] [2025-02-08 01:20:43,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678801577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:43,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860521954] [2025-02-08 01:20:43,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:20:43,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:43,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:20:43,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:20:43,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 01:20:43,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:20:43,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:43,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:43,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 01:20:43,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:43,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 01:20:43,923 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-02-08 01:20:43,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-02-08 01:20:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:43,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:20:45,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2025-02-08 01:20:45,111 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-02-08 01:20:45,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 196 [2025-02-08 01:20:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:46,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860521954] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:20:46,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:20:46,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2025-02-08 01:20:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833941898] [2025-02-08 01:20:46,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:20:46,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-08 01:20:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:46,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-08 01:20:46,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1530, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 01:20:46,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-02-08 01:20:46,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 702 transitions, 9234 flow. Second operand has 43 states, 43 states have (on average 8.279069767441861) internal successors, (356), 43 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:46,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:46,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-02-08 01:20:46,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:08,986 INFO L124 PetriNetUnfolderBase]: 56907/90749 cut-off events. [2025-02-08 01:21:08,987 INFO L125 PetriNetUnfolderBase]: For 2873579/2873579 co-relation queries the response was YES.