./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series3.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 c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:40:22,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:40:22,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:40:22,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:40:22,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:40:22,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:40:22,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:40:22,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:40:22,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:40:22,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:40:22,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:40:22,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:40:22,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:40:22,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:40:22,485 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:40:22,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:40:22,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:40:22,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:40:22,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:40:22,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:40:22,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:40:22,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:40:22,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:40:22,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:40:22,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:40:22,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:40:22,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:40:22,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:40:22,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:40:22,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:40:22,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:40:22,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:40:22,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:40:22,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:40:22,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:40:22,490 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 -> c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c [2025-02-06 04:40:22,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:40:22,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:40:22,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:40:22,802 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:40:22,802 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:40:22,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2025-02-06 04:40:24,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20c39397a/57e9196e631f4768854a58516ef49ac7/FLAGd89e541f6 [2025-02-06 04:40:24,366 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:40:24,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2025-02-06 04:40:24,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20c39397a/57e9196e631f4768854a58516ef49ac7/FLAGd89e541f6 [2025-02-06 04:40:24,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20c39397a/57e9196e631f4768854a58516ef49ac7 [2025-02-06 04:40:24,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:40:24,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:40:24,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:40:24,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:40:24,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:40:24,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a087c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24, skipping insertion in model container [2025-02-06 04:40:24,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:40:24,616 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-more-buffer-series3.wvr.c[4403,4416] [2025-02-06 04:40:24,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:40:24,639 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:40:24,673 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-more-buffer-series3.wvr.c[4403,4416] [2025-02-06 04:40:24,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:40:24,698 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:40:24,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24 WrapperNode [2025-02-06 04:40:24,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:40:24,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:40:24,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:40:24,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:40:24,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,748 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 319 [2025-02-06 04:40:24,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:40:24,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:40:24,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:40:24,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:40:24,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,793 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-06 04:40:24,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,809 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:40:24,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:40:24,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:40:24,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:40:24,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (1/1) ... [2025-02-06 04:40:24,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:40:24,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:40:24,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:40:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:40:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:40:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:40:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:40:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:40:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:40:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:40:24,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:40:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:40:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:40:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:40:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:40:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 04:40:24,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 04:40:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:40:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:40:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:40:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:40:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:40:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:40:24,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:40:24,892 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:40:24,988 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:40:24,990 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:40:25,414 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:40:25,415 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:40:25,731 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:40:25,732 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:40:25,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:25 BoogieIcfgContainer [2025-02-06 04:40:25,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:40:25,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:40:25,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:40:25,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:40:25,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:40:24" (1/3) ... [2025-02-06 04:40:25,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dbb86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:25, skipping insertion in model container [2025-02-06 04:40:25,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:24" (2/3) ... [2025-02-06 04:40:25,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dbb86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:25, skipping insertion in model container [2025-02-06 04:40:25,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:25" (3/3) ... [2025-02-06 04:40:25,740 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2025-02-06 04:40:25,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:40:25,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series3.wvr.c that has 5 procedures, 46 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-06 04:40:25,756 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:40:25,822 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 04:40:25,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 132 flow [2025-02-06 04:40:25,901 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2025-02-06 04:40:25,904 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:40:25,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 7/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-02-06 04:40:25,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 132 flow [2025-02-06 04:40:25,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 47 transitions, 118 flow [2025-02-06 04:40:25,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:40:25,937 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;@4c065d26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:40:25,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:40:25,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:40:25,959 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2025-02-06 04:40:25,959 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:40:25,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:25,960 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-06 04:40:25,960 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 2 more)] === [2025-02-06 04:40:25,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash 366776383, now seen corresponding path program 1 times [2025-02-06 04:40:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:25,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448334438] [2025-02-06 04:40:25,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:26,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:40:26,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:40:26,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:26,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:26,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:26,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448334438] [2025-02-06 04:40:26,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448334438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:26,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849045681] [2025-02-06 04:40:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:26,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:26,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:26,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:26,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-02-06 04:40:26,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:26,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:26,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-02-06 04:40:26,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:27,450 INFO L124 PetriNetUnfolderBase]: 5629/7734 cut-off events. [2025-02-06 04:40:27,451 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2025-02-06 04:40:27,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15602 conditions, 7734 events. 5629/7734 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 39176 event pairs, 1634 based on Foata normal form. 1/7559 useless extension candidates. Maximal degree in co-relation 14262. Up to 4718 conditions per place. [2025-02-06 04:40:27,529 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 57 selfloop transitions, 3 changer transitions 1/70 dead transitions. [2025-02-06 04:40:27,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 301 flow [2025-02-06 04:40:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-02-06 04:40:27,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2025-02-06 04:40:27,546 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 118 flow. Second operand 3 states and 101 transitions. [2025-02-06 04:40:27,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 301 flow [2025-02-06 04:40:27,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 275 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 04:40:27,565 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 121 flow [2025-02-06 04:40:27,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2025-02-06 04:40:27,572 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-02-06 04:40:27,572 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 121 flow [2025-02-06 04:40:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:27,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:27,573 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, 1, 1, 1] [2025-02-06 04:40:27,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:40:27,573 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 2 more)] === [2025-02-06 04:40:27,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2046079184, now seen corresponding path program 1 times [2025-02-06 04:40:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:27,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118760678] [2025-02-06 04:40:27,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:27,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:40:27,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:40:27,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:27,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:27,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:27,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118760678] [2025-02-06 04:40:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118760678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415203185] [2025-02-06 04:40:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:27,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:27,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:27,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:27,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-02-06 04:40:27,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-06 04:40:27,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:27,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-02-06 04:40:27,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:28,808 INFO L124 PetriNetUnfolderBase]: 7551/10537 cut-off events. [2025-02-06 04:40:28,809 INFO L125 PetriNetUnfolderBase]: For 1366/1366 co-relation queries the response was YES. [2025-02-06 04:40:28,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22195 conditions, 10537 events. 7551/10537 cut-off events. For 1366/1366 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 58084 event pairs, 2860 based on Foata normal form. 296/10708 useless extension candidates. Maximal degree in co-relation 8943. Up to 6208 conditions per place. [2025-02-06 04:40:28,874 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 65 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-02-06 04:40:28,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 76 transitions, 323 flow [2025-02-06 04:40:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-02-06 04:40:28,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 04:40:28,878 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 121 flow. Second operand 3 states and 104 transitions. [2025-02-06 04:40:28,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 76 transitions, 323 flow [2025-02-06 04:40:28,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:28,880 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 132 flow [2025-02-06 04:40:28,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2025-02-06 04:40:28,882 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-02-06 04:40:28,882 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 132 flow [2025-02-06 04:40:28,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-06 04:40:28,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:28,882 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, 1, 1, 1] [2025-02-06 04:40:28,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:40:28,883 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 2 more)] === [2025-02-06 04:40:28,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash 421941302, now seen corresponding path program 1 times [2025-02-06 04:40:28,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:28,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54721375] [2025-02-06 04:40:28,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:28,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:28,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:40:28,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:40:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:28,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:29,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54721375] [2025-02-06 04:40:29,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54721375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:29,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:29,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161135891] [2025-02-06 04:40:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:29,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:29,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:29,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:29,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-02-06 04:40:29,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-06 04:40:29,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:29,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-02-06 04:40:29,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:30,328 INFO L124 PetriNetUnfolderBase]: 9987/14068 cut-off events. [2025-02-06 04:40:30,329 INFO L125 PetriNetUnfolderBase]: For 3447/3455 co-relation queries the response was YES. [2025-02-06 04:40:30,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30452 conditions, 14068 events. 9987/14068 cut-off events. For 3447/3455 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 80580 event pairs, 3689 based on Foata normal form. 269/14256 useless extension candidates. Maximal degree in co-relation 14945. Up to 8300 conditions per place. [2025-02-06 04:40:30,391 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 65 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-02-06 04:40:30,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 339 flow [2025-02-06 04:40:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-02-06 04:40:30,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2025-02-06 04:40:30,394 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 132 flow. Second operand 3 states and 102 transitions. [2025-02-06 04:40:30,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 339 flow [2025-02-06 04:40:30,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:30,397 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 144 flow [2025-02-06 04:40:30,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2025-02-06 04:40:30,399 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2025-02-06 04:40:30,399 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 144 flow [2025-02-06 04:40:30,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-06 04:40:30,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:30,400 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:30,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:40:30,400 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 2 more)] === [2025-02-06 04:40:30,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:30,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1296409253, now seen corresponding path program 1 times [2025-02-06 04:40:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:30,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498453540] [2025-02-06 04:40:30,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:30,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:40:30,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:40:30,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498453540] [2025-02-06 04:40:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498453540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:30,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:30,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:40:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434526237] [2025-02-06 04:40:30,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:30,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:40:30,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:30,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:40:30,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:40:30,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-02-06 04:40:30,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:30,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:30,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-02-06 04:40:30,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:31,978 INFO L124 PetriNetUnfolderBase]: 12502/17808 cut-off events. [2025-02-06 04:40:31,978 INFO L125 PetriNetUnfolderBase]: For 5379/5441 co-relation queries the response was YES. [2025-02-06 04:40:32,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39817 conditions, 17808 events. 12502/17808 cut-off events. For 5379/5441 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 106910 event pairs, 10539 based on Foata normal form. 281/18027 useless extension candidates. Maximal degree in co-relation 20742. Up to 13297 conditions per place. [2025-02-06 04:40:32,103 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 73 selfloop transitions, 7 changer transitions 0/89 dead transitions. [2025-02-06 04:40:32,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 403 flow [2025-02-06 04:40:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:40:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:40:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2025-02-06 04:40:32,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-02-06 04:40:32,105 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 144 flow. Second operand 5 states and 140 transitions. [2025-02-06 04:40:32,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 403 flow [2025-02-06 04:40:32,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:32,108 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 194 flow [2025-02-06 04:40:32,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-02-06 04:40:32,109 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2025-02-06 04:40:32,109 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 194 flow [2025-02-06 04:40:32,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:32,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:32,109 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:32,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:40:32,110 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 2 more)] === [2025-02-06 04:40:32,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1238261371, now seen corresponding path program 1 times [2025-02-06 04:40:32,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:32,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384164910] [2025-02-06 04:40:32,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:32,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:40:32,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:40:32,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:32,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:32,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:32,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384164910] [2025-02-06 04:40:32,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384164910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:32,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:32,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:40:32,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638383046] [2025-02-06 04:40:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:32,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:40:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:32,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:40:32,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:40:32,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-02-06 04:40:32,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:32,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:32,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-02-06 04:40:32,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:33,776 INFO L124 PetriNetUnfolderBase]: 15702/22588 cut-off events. [2025-02-06 04:40:33,776 INFO L125 PetriNetUnfolderBase]: For 7188/7242 co-relation queries the response was YES. [2025-02-06 04:40:33,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50563 conditions, 22588 events. 15702/22588 cut-off events. For 7188/7242 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 142502 event pairs, 13476 based on Foata normal form. 411/22895 useless extension candidates. Maximal degree in co-relation 40812. Up to 16810 conditions per place. [2025-02-06 04:40:33,885 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 75 selfloop transitions, 7 changer transitions 2/93 dead transitions. [2025-02-06 04:40:33,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 478 flow [2025-02-06 04:40:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:40:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:40:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-02-06 04:40:33,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2025-02-06 04:40:33,887 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 194 flow. Second operand 5 states and 136 transitions. [2025-02-06 04:40:33,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 478 flow [2025-02-06 04:40:33,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 474 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:33,891 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 244 flow [2025-02-06 04:40:33,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2025-02-06 04:40:33,892 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-02-06 04:40:33,892 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 244 flow [2025-02-06 04:40:33,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:33,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:33,892 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:33,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:40:33,893 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 2 more)] === [2025-02-06 04:40:33,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1747134693, now seen corresponding path program 1 times [2025-02-06 04:40:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:33,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038733965] [2025-02-06 04:40:33,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:33,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 04:40:33,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:40:33,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:33,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:34,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038733965] [2025-02-06 04:40:34,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038733965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:34,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:34,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:40:34,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725904070] [2025-02-06 04:40:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:34,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:40:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:34,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:40:34,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:40:34,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-06 04:40:34,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:34,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:34,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-06 04:40:34,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:36,959 INFO L124 PetriNetUnfolderBase]: 27121/37773 cut-off events. [2025-02-06 04:40:36,959 INFO L125 PetriNetUnfolderBase]: For 11785/11839 co-relation queries the response was YES. [2025-02-06 04:40:37,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86878 conditions, 37773 events. 27121/37773 cut-off events. For 11785/11839 co-relation queries the response was YES. Maximal size of possible extension queue 1213. Compared 238839 event pairs, 11859 based on Foata normal form. 0/36066 useless extension candidates. Maximal degree in co-relation 67858. Up to 15101 conditions per place. [2025-02-06 04:40:37,161 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 150 selfloop transitions, 17 changer transitions 0/175 dead transitions. [2025-02-06 04:40:37,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 175 transitions, 920 flow [2025-02-06 04:40:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:40:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:40:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 242 transitions. [2025-02-06 04:40:37,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5817307692307693 [2025-02-06 04:40:37,163 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 244 flow. Second operand 8 states and 242 transitions. [2025-02-06 04:40:37,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 175 transitions, 920 flow [2025-02-06 04:40:37,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 175 transitions, 908 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:37,169 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 336 flow [2025-02-06 04:40:37,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=336, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-02-06 04:40:37,170 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2025-02-06 04:40:37,170 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 336 flow [2025-02-06 04:40:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:37,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:37,171 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:37,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:40:37,171 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 2 more)] === [2025-02-06 04:40:37,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1109659099, now seen corresponding path program 2 times [2025-02-06 04:40:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:37,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057777792] [2025-02-06 04:40:37,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:40:37,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:37,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 04:40:37,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 38 statements. [2025-02-06 04:40:37,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:40:37,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:40:37,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:37,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057777792] [2025-02-06 04:40:37,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057777792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:37,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:37,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:40:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884007945] [2025-02-06 04:40:37,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:37,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:40:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:37,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:40:37,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:40:37,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-06 04:40:37,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:37,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:37,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-06 04:40:37,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:39,986 INFO L124 PetriNetUnfolderBase]: 26481/37746 cut-off events. [2025-02-06 04:40:39,986 INFO L125 PetriNetUnfolderBase]: For 28266/28370 co-relation queries the response was YES. [2025-02-06 04:40:40,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95463 conditions, 37746 events. 26481/37746 cut-off events. For 28266/28370 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 248971 event pairs, 19105 based on Foata normal form. 0/36147 useless extension candidates. Maximal degree in co-relation 75244. Up to 28111 conditions per place. [2025-02-06 04:40:40,216 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 92 selfloop transitions, 10 changer transitions 1/111 dead transitions. [2025-02-06 04:40:40,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 645 flow [2025-02-06 04:40:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:40:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:40:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-02-06 04:40:40,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064102564102564 [2025-02-06 04:40:40,218 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 336 flow. Second operand 6 states and 158 transitions. [2025-02-06 04:40:40,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 645 flow [2025-02-06 04:40:40,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 629 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-06 04:40:40,257 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 302 flow [2025-02-06 04:40:40,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2025-02-06 04:40:40,258 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2025-02-06 04:40:40,258 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 302 flow [2025-02-06 04:40:40,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:40,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:40,258 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:40,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:40:40,259 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 2 more)] === [2025-02-06 04:40:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1751423888, now seen corresponding path program 1 times [2025-02-06 04:40:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:40,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240289776] [2025-02-06 04:40:40,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:40,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 04:40:40,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:40:40,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:40,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:40:40,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:40,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240289776] [2025-02-06 04:40:40,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240289776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:40,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:40,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:40:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601605644] [2025-02-06 04:40:40,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:40,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:40:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:40,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:40:40,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:40:40,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-02-06 04:40:40,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:40,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:40,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-02-06 04:40:40,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:42,655 INFO L124 PetriNetUnfolderBase]: 22584/31888 cut-off events. [2025-02-06 04:40:42,655 INFO L125 PetriNetUnfolderBase]: For 23389/23401 co-relation queries the response was YES. [2025-02-06 04:40:42,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80914 conditions, 31888 events. 22584/31888 cut-off events. For 23389/23401 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 201691 event pairs, 18801 based on Foata normal form. 0/30069 useless extension candidates. Maximal degree in co-relation 68112. Up to 28854 conditions per place. [2025-02-06 04:40:42,853 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 45 selfloop transitions, 7 changer transitions 34/94 dead transitions. [2025-02-06 04:40:42,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 94 transitions, 553 flow [2025-02-06 04:40:42,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:40:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:40:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-02-06 04:40:42,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2025-02-06 04:40:42,854 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 302 flow. Second operand 6 states and 146 transitions. [2025-02-06 04:40:42,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 94 transitions, 553 flow [2025-02-06 04:40:42,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 94 transitions, 537 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:40:42,866 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 266 flow [2025-02-06 04:40:42,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2025-02-06 04:40:42,866 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2025-02-06 04:40:42,867 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 266 flow [2025-02-06 04:40:42,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:42,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:42,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:42,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:40:42,867 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 2 more)] === [2025-02-06 04:40:42,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash 226346526, now seen corresponding path program 1 times [2025-02-06 04:40:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:42,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52395807] [2025-02-06 04:40:42,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:42,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:42,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 04:40:42,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:40:42,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:42,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:43,171 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-06 04:40:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52395807] [2025-02-06 04:40:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52395807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:40:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665619890] [2025-02-06 04:40:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:43,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:40:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:43,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:40:43,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:40:43,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-02-06 04:40:43,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:43,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:43,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-02-06 04:40:43,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:45,444 INFO L124 PetriNetUnfolderBase]: 18780/27469 cut-off events. [2025-02-06 04:40:45,444 INFO L125 PetriNetUnfolderBase]: For 22207/22217 co-relation queries the response was YES. [2025-02-06 04:40:45,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70935 conditions, 27469 events. 18780/27469 cut-off events. For 22207/22217 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 178385 event pairs, 4704 based on Foata normal form. 1329/28347 useless extension candidates. Maximal degree in co-relation 60557. Up to 14525 conditions per place. [2025-02-06 04:40:45,590 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 97 selfloop transitions, 9 changer transitions 8/123 dead transitions. [2025-02-06 04:40:45,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 717 flow [2025-02-06 04:40:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:40:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:40:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2025-02-06 04:40:45,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5137362637362637 [2025-02-06 04:40:45,592 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 266 flow. Second operand 7 states and 187 transitions. [2025-02-06 04:40:45,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 717 flow [2025-02-06 04:40:45,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 123 transitions, 687 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-06 04:40:45,609 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 276 flow [2025-02-06 04:40:45,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2025-02-06 04:40:45,610 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2025-02-06 04:40:45,610 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 276 flow [2025-02-06 04:40:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:45,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:45,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:45,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:40:45,610 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 2 more)] === [2025-02-06 04:40:45,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1118257521, now seen corresponding path program 1 times [2025-02-06 04:40:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:45,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782339843] [2025-02-06 04:40:45,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:45,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 04:40:45,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:40:45,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:45,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:40:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:45,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782339843] [2025-02-06 04:40:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782339843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:45,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:45,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:40:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484347376] [2025-02-06 04:40:45,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:45,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:40:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:45,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:40:45,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:40:45,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-02-06 04:40:45,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:45,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:45,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-02-06 04:40:45,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:47,497 INFO L124 PetriNetUnfolderBase]: 11783/17213 cut-off events. [2025-02-06 04:40:47,497 INFO L125 PetriNetUnfolderBase]: For 20312/20406 co-relation queries the response was YES. [2025-02-06 04:40:47,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48575 conditions, 17213 events. 11783/17213 cut-off events. For 20312/20406 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 108618 event pairs, 1978 based on Foata normal form. 636/17629 useless extension candidates. Maximal degree in co-relation 42074. Up to 11294 conditions per place. [2025-02-06 04:40:47,593 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 93 selfloop transitions, 5 changer transitions 4/111 dead transitions. [2025-02-06 04:40:47,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 682 flow [2025-02-06 04:40:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:40:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:40:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-02-06 04:40:47,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967948717948718 [2025-02-06 04:40:47,594 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 276 flow. Second operand 6 states and 155 transitions. [2025-02-06 04:40:47,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 682 flow [2025-02-06 04:40:47,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 646 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-02-06 04:40:47,602 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 248 flow [2025-02-06 04:40:47,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2025-02-06 04:40:47,603 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2025-02-06 04:40:47,603 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 248 flow [2025-02-06 04:40:47,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:47,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:47,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:40:47,604 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 2 more)] === [2025-02-06 04:40:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -820839648, now seen corresponding path program 1 times [2025-02-06 04:40:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185364594] [2025-02-06 04:40:47,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:47,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 04:40:47,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 04:40:47,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:47,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:40:47,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:47,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185364594] [2025-02-06 04:40:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185364594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:47,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:47,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:40:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211522239] [2025-02-06 04:40:47,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:47,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:40:47,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:47,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:40:47,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:40:47,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-02-06 04:40:47,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:47,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:47,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-02-06 04:40:47,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:49,962 INFO L124 PetriNetUnfolderBase]: 13938/19755 cut-off events. [2025-02-06 04:40:49,963 INFO L125 PetriNetUnfolderBase]: For 28052/28056 co-relation queries the response was YES. [2025-02-06 04:40:50,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58601 conditions, 19755 events. 13938/19755 cut-off events. For 28052/28056 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 119481 event pairs, 2511 based on Foata normal form. 752/20490 useless extension candidates. Maximal degree in co-relation 58568. Up to 11372 conditions per place. [2025-02-06 04:40:50,104 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 114 selfloop transitions, 7 changer transitions 0/130 dead transitions. [2025-02-06 04:40:50,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 130 transitions, 783 flow [2025-02-06 04:40:50,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:40:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:40:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2025-02-06 04:40:50,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2025-02-06 04:40:50,106 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 248 flow. Second operand 7 states and 184 transitions. [2025-02-06 04:40:50,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 130 transitions, 783 flow [2025-02-06 04:40:50,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 130 transitions, 759 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 04:40:50,120 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 273 flow [2025-02-06 04:40:50,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2025-02-06 04:40:50,120 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2025-02-06 04:40:50,120 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 273 flow [2025-02-06 04:40:50,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:50,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:50,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:50,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:40:50,121 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 2 more)] === [2025-02-06 04:40:50,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash 479178216, now seen corresponding path program 1 times [2025-02-06 04:40:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:50,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797499722] [2025-02-06 04:40:50,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:50,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 04:40:50,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 04:40:50,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:50,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:40:50,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:40:50,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 04:40:50,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 04:40:50,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:50,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:40:50,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:40:50,279 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:40:50,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-02-06 04:40:50,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-02-06 04:40:50,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-06 04:40:50,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-06 04:40:50,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-02-06 04:40:50,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:40:50,282 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:50,404 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:40:50,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:40:50,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:40:50 BasicIcfg [2025-02-06 04:40:50,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:40:50,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:40:50,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:40:50,412 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:40:50,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:25" (3/4) ... [2025-02-06 04:40:50,413 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:40:50,526 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 76. [2025-02-06 04:40:50,619 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:40:50,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:40:50,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:40:50,624 INFO L158 Benchmark]: Toolchain (without parser) took 26235.05ms. Allocated memory was 142.6MB in the beginning and 9.9GB in the end (delta: 9.8GB). Free memory was 111.5MB in the beginning and 8.2GB in the end (delta: -8.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-02-06 04:40:50,624 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:40:50,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.24ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.0MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:40:50,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.43ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:40:50,624 INFO L158 Benchmark]: Boogie Preprocessor took 68.44ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:40:50,624 INFO L158 Benchmark]: IcfgBuilder took 911.21ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 76.1MB in the end (delta: 16.7MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2025-02-06 04:40:50,625 INFO L158 Benchmark]: TraceAbstraction took 24676.91ms. Allocated memory was 142.6MB in the beginning and 9.9GB in the end (delta: 9.8GB). Free memory was 75.4MB in the beginning and 8.3GB in the end (delta: -8.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-02-06 04:40:50,625 INFO L158 Benchmark]: Witness Printer took 211.43ms. Allocated memory is still 9.9GB. Free memory was 8.3GB in the beginning and 8.2GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:40:50,626 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.24ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.0MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.43ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.44ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 911.21ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 76.1MB in the end (delta: 16.7MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24676.91ms. Allocated memory was 142.6MB in the beginning and 9.9GB in the end (delta: 9.8GB). Free memory was 75.4MB in the beginning and 8.3GB in the end (delta: -8.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 211.43ms. Allocated memory is still 9.9GB. Free memory was 8.3GB in the beginning and 8.2GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-2:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-2:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=0, total=0] [L49] 1 _Bool cond = i < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=0, t2=1, total=0] [L71] 2 _Bool cond = j < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=0, t2=1, t3=2, total=0] [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=0] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L82] 2 q2_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L85] 2 cond = j < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L73] COND FALSE 2 !(\read(cond)) [L89] 2 return 0; [L114] COND FALSE 4 !(\read(cond)) [L125] 4 return 0; [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L59] 1 q1_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L62] 1 cond = i < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 0; [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L96] COND TRUE 3 \read(cond) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L98] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L98] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L99] EXPR 3 q1[q1_front] [L99] CALL, EXPR 3 plus(total, q1[q1_front]) [L172] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L172] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L173] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 3 return a + b; [L99] RET, EXPR 3 plus(total, q1[q1_front]) [L99] 3 total = plus(total, q1[q1_front]) [L100] 3 q1_front++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=-6] [L103] 3 cond = i < N || q1_front < q1_back VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=-6] [L96] COND FALSE 3 !(\read(cond)) [L107] 3 return 0; [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=-6] [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=-6] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=-6] [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=-6] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=-6] - UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 76 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 584 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1654 IncrementalHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 4 mSDtfsCounter, 1654 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 450 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 1272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:40:50,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE