./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 f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-f8ab0bd-m [2025-03-13 21:48:31,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:48:32,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:48:32,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:48:32,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:48:32,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:48:32,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:48:32,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:48:32,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:48:32,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:48:32,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:48:32,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:48:32,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:48:32,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:48:32,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:48:32,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:48:32,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:48:32,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:48:32,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:48:32,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:48:32,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:48:32,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:48:32,043 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/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-03-13 21:48:32,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:48:32,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:48:32,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:48:32,269 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:48:32,269 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:48:32,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2025-03-13 21:48:33,368 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd217db61/9454e844c8e04714a50f5d0c2d5e8ce9/FLAG321bcdce1 [2025-03-13 21:48:33,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:48:33,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2025-03-13 21:48:33,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd217db61/9454e844c8e04714a50f5d0c2d5e8ce9/FLAG321bcdce1 [2025-03-13 21:48:33,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd217db61/9454e844c8e04714a50f5d0c2d5e8ce9 [2025-03-13 21:48:33,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:48:33,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:48:33,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:48:33,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:48:33,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:48:33,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e4d15bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33, skipping insertion in model container [2025-03-13 21:48:33,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:48:33,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2025-03-13 21:48:33,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:48:33,802 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:48:33,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2025-03-13 21:48:33,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:48:33,844 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:48:33,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33 WrapperNode [2025-03-13 21:48:33,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:48:33,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:48:33,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:48:33,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:48:33,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,882 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 319 [2025-03-13 21:48:33,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:48:33,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:48:33,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:48:33,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:48:33,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,911 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-03-13 21:48:33,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:48:33,923 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:48:33,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:48:33,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:48:33,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (1/1) ... [2025-03-13 21:48:33,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:48:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:33,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:48:33,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:48:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:48:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:48:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:48:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:48:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:48:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:48:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:48:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:48:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:48:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:48:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:48:33,967 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:48:34,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:48:34,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:48:34,397 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:48:34,399 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:48:34,399 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:48:34,744 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:48:34,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:34 BoogieIcfgContainer [2025-03-13 21:48:34,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:48:34,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:48:34,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:48:34,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:48:34,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:48:33" (1/3) ... [2025-03-13 21:48:34,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d74058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:48:34, skipping insertion in model container [2025-03-13 21:48:34,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:33" (2/3) ... [2025-03-13 21:48:34,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d74058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:48:34, skipping insertion in model container [2025-03-13 21:48:34,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:34" (3/3) ... [2025-03-13 21:48:34,754 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2025-03-13 21:48:34,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:48:34,769 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-03-13 21:48:34,769 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:48:34,833 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:48:34,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 132 flow [2025-03-13 21:48:34,895 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2025-03-13 21:48:34,898 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:48:34,901 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-03-13 21:48:34,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 132 flow [2025-03-13 21:48:34,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 47 transitions, 118 flow [2025-03-13 21:48:34,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:48:34,930 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;@2f0a84b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:48:34,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:48:34,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:48:34,948 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2025-03-13 21:48:34,948 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:48:34,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:34,949 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-03-13 21:48:34,950 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-03-13 21:48:34,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 366776383, now seen corresponding path program 1 times [2025-03-13 21:48:34,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:34,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703771696] [2025-03-13 21:48:34,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:35,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:48:35,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:48:35,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:35,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703771696] [2025-03-13 21:48:35,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703771696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:35,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:35,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313277669] [2025-03-13 21:48:35,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:35,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:35,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:35,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:35,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:35,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-03-13 21:48:35,296 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-03-13 21:48:35,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:35,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-03-13 21:48:35,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:36,038 INFO L124 PetriNetUnfolderBase]: 5629/7734 cut-off events. [2025-03-13 21:48:36,039 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2025-03-13 21:48:36,054 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-03-13 21:48:36,086 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 57 selfloop transitions, 3 changer transitions 1/70 dead transitions. [2025-03-13 21:48:36,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 301 flow [2025-03-13 21:48:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-13 21:48:36,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2025-03-13 21:48:36,095 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 118 flow. Second operand 3 states and 101 transitions. [2025-03-13 21:48:36,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 301 flow [2025-03-13 21:48:36,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 275 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:48:36,113 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 121 flow [2025-03-13 21:48:36,114 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-03-13 21:48:36,120 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-13 21:48:36,120 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 121 flow [2025-03-13 21:48:36,121 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-03-13 21:48:36,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:36,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] [2025-03-13 21:48:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:48:36,121 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-03-13 21:48:36,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2046079184, now seen corresponding path program 1 times [2025-03-13 21:48:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780732696] [2025-03-13 21:48:36,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:36,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:48:36,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:48:36,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:36,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780732696] [2025-03-13 21:48:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780732696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:36,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:36,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736517641] [2025-03-13 21:48:36,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:36,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:36,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:36,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:36,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-03-13 21:48:36,307 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-03-13 21:48:36,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:36,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-03-13 21:48:36,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:36,961 INFO L124 PetriNetUnfolderBase]: 7551/10537 cut-off events. [2025-03-13 21:48:36,961 INFO L125 PetriNetUnfolderBase]: For 1366/1366 co-relation queries the response was YES. [2025-03-13 21:48:36,970 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-03-13 21:48:37,003 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 65 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-03-13 21:48:37,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 76 transitions, 323 flow [2025-03-13 21:48:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-13 21:48:37,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-13 21:48:37,005 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 121 flow. Second operand 3 states and 104 transitions. [2025-03-13 21:48:37,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 76 transitions, 323 flow [2025-03-13 21:48:37,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:37,006 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 132 flow [2025-03-13 21:48:37,006 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-03-13 21:48:37,007 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-13 21:48:37,007 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 132 flow [2025-03-13 21:48:37,007 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-03-13 21:48:37,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:37,007 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-03-13 21:48:37,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:48:37,007 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-03-13 21:48:37,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:37,008 INFO L85 PathProgramCache]: Analyzing trace with hash 421941302, now seen corresponding path program 1 times [2025-03-13 21:48:37,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:37,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049985922] [2025-03-13 21:48:37,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:37,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:37,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:48:37,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:48:37,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:37,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:37,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:37,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049985922] [2025-03-13 21:48:37,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049985922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:37,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:37,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:37,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822698684] [2025-03-13 21:48:37,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:37,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:37,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:37,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:37,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:37,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-03-13 21:48:37,130 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-03-13 21:48:37,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:37,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-03-13 21:48:37,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:38,044 INFO L124 PetriNetUnfolderBase]: 9987/14068 cut-off events. [2025-03-13 21:48:38,044 INFO L125 PetriNetUnfolderBase]: For 3447/3455 co-relation queries the response was YES. [2025-03-13 21:48:38,063 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-03-13 21:48:38,110 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 65 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-03-13 21:48:38,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 339 flow [2025-03-13 21:48:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-13 21:48:38,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2025-03-13 21:48:38,111 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 132 flow. Second operand 3 states and 102 transitions. [2025-03-13 21:48:38,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 339 flow [2025-03-13 21:48:38,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:38,114 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 144 flow [2025-03-13 21:48:38,114 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-03-13 21:48:38,115 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2025-03-13 21:48:38,116 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 144 flow [2025-03-13 21:48:38,116 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-03-13 21:48:38,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:38,116 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-03-13 21:48:38,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:48:38,116 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-03-13 21:48:38,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1296409253, now seen corresponding path program 1 times [2025-03-13 21:48:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:38,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802714897] [2025-03-13 21:48:38,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:38,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:48:38,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:48:38,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:38,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:38,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:38,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802714897] [2025-03-13 21:48:38,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802714897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:38,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:38,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:48:38,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590956256] [2025-03-13 21:48:38,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:38,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:48:38,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:38,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:48:38,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:48:38,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-03-13 21:48:38,297 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-03-13 21:48:38,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:38,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-03-13 21:48:38,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:39,160 INFO L124 PetriNetUnfolderBase]: 12500/17804 cut-off events. [2025-03-13 21:48:39,160 INFO L125 PetriNetUnfolderBase]: For 5379/5441 co-relation queries the response was YES. [2025-03-13 21:48:39,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39809 conditions, 17804 events. 12500/17804 cut-off events. For 5379/5441 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 106973 event pairs, 10539 based on Foata normal form. 281/18025 useless extension candidates. Maximal degree in co-relation 20734. Up to 13297 conditions per place. [2025-03-13 21:48:39,247 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 73 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-03-13 21:48:39,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 387 flow [2025-03-13 21:48:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:48:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:48:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-03-13 21:48:39,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5913461538461539 [2025-03-13 21:48:39,248 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 144 flow. Second operand 4 states and 123 transitions. [2025-03-13 21:48:39,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 387 flow [2025-03-13 21:48:39,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:39,251 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 162 flow [2025-03-13 21:48:39,251 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=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2025-03-13 21:48:39,252 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2025-03-13 21:48:39,252 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 162 flow [2025-03-13 21:48:39,252 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-03-13 21:48:39,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:39,252 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-03-13 21:48:39,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:48:39,252 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-03-13 21:48:39,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1238261371, now seen corresponding path program 1 times [2025-03-13 21:48:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:39,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562038079] [2025-03-13 21:48:39,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:39,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:48:39,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:48:39,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:39,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562038079] [2025-03-13 21:48:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562038079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:48:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827216396] [2025-03-13 21:48:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:48:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:39,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:48:39,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:48:39,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-03-13 21:48:39,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 162 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-03-13 21:48:39,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:39,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-03-13 21:48:39,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:40,740 INFO L124 PetriNetUnfolderBase]: 15701/22657 cut-off events. [2025-03-13 21:48:40,741 INFO L125 PetriNetUnfolderBase]: For 7065/7107 co-relation queries the response was YES. [2025-03-13 21:48:40,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50601 conditions, 22657 events. 15701/22657 cut-off events. For 7065/7107 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 143944 event pairs, 13476 based on Foata normal form. 411/22970 useless extension candidates. Maximal degree in co-relation 40873. Up to 16808 conditions per place. [2025-03-13 21:48:40,847 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 72 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-13 21:48:40,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 410 flow [2025-03-13 21:48:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:48:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:48:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-13 21:48:40,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2025-03-13 21:48:40,849 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 162 flow. Second operand 5 states and 136 transitions. [2025-03-13 21:48:40,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 410 flow [2025-03-13 21:48:40,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 406 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:40,857 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 197 flow [2025-03-13 21:48:40,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-03-13 21:48:40,858 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-03-13 21:48:40,858 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 197 flow [2025-03-13 21:48:40,858 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-03-13 21:48:40,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:40,858 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-03-13 21:48:40,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:48:40,858 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-03-13 21:48:40,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:40,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1151103896, now seen corresponding path program 1 times [2025-03-13 21:48:40,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:40,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203877012] [2025-03-13 21:48:40,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:40,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:40,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:48:40,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:48:40,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:40,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:41,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203877012] [2025-03-13 21:48:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203877012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:41,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:41,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:41,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107202533] [2025-03-13 21:48:41,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:41,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:48:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:41,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:48:41,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:48:41,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-03-13 21:48:41,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 197 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-03-13 21:48:41,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:41,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-03-13 21:48:41,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:42,913 INFO L124 PetriNetUnfolderBase]: 26341/37291 cut-off events. [2025-03-13 21:48:42,913 INFO L125 PetriNetUnfolderBase]: For 11172/11188 co-relation queries the response was YES. [2025-03-13 21:48:43,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84656 conditions, 37291 events. 26341/37291 cut-off events. For 11172/11188 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 243314 event pairs, 10269 based on Foata normal form. 0/35769 useless extension candidates. Maximal degree in co-relation 68822. Up to 14779 conditions per place. [2025-03-13 21:48:43,076 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 115 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2025-03-13 21:48:43,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 132 transitions, 664 flow [2025-03-13 21:48:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-03-13 21:48:43,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5801282051282052 [2025-03-13 21:48:43,077 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 197 flow. Second operand 6 states and 181 transitions. [2025-03-13 21:48:43,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 132 transitions, 664 flow [2025-03-13 21:48:43,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 657 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:43,083 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 248 flow [2025-03-13 21:48:43,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-03-13 21:48:43,083 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-03-13 21:48:43,083 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 248 flow [2025-03-13 21:48:43,084 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-03-13 21:48:43,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:43,084 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-03-13 21:48:43,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:48:43,084 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-03-13 21:48:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 344114027, now seen corresponding path program 1 times [2025-03-13 21:48:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707912885] [2025-03-13 21:48:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:43,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:48:43,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:48:43,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:43,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707912885] [2025-03-13 21:48:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707912885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:43,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958999981] [2025-03-13 21:48:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:43,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:48:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:43,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:48:43,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:48:43,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2025-03-13 21:48:43,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 248 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-03-13 21:48:43,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:43,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2025-03-13 21:48:43,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:45,109 INFO L124 PetriNetUnfolderBase]: 21809/31176 cut-off events. [2025-03-13 21:48:45,110 INFO L125 PetriNetUnfolderBase]: For 13190/13190 co-relation queries the response was YES. [2025-03-13 21:48:45,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74045 conditions, 31176 events. 21809/31176 cut-off events. For 13190/13190 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 201418 event pairs, 9203 based on Foata normal form. 0/29794 useless extension candidates. Maximal degree in co-relation 56339. Up to 15105 conditions per place. [2025-03-13 21:48:45,281 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 73 selfloop transitions, 6 changer transitions 35/122 dead transitions. [2025-03-13 21:48:45,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 647 flow [2025-03-13 21:48:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-03-13 21:48:45,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2025-03-13 21:48:45,282 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 248 flow. Second operand 6 states and 173 transitions. [2025-03-13 21:48:45,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 647 flow [2025-03-13 21:48:45,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 638 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:45,292 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 244 flow [2025-03-13 21:48:45,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-03-13 21:48:45,293 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2025-03-13 21:48:45,293 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 244 flow [2025-03-13 21:48:45,293 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-03-13 21:48:45,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:45,293 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-03-13 21:48:45,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:48:45,293 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-03-13 21:48:45,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash -110030120, now seen corresponding path program 1 times [2025-03-13 21:48:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:45,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425311211] [2025-03-13 21:48:45,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:45,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:45,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:48:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:48:45,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:45,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:48:45,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425311211] [2025-03-13 21:48:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425311211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972665355] [2025-03-13 21:48:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:45,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:48:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:45,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:48:45,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:48:45,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-03-13 21:48:45,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 244 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-03-13 21:48:45,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:45,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-03-13 21:48:45,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:46,638 INFO L124 PetriNetUnfolderBase]: 13221/19614 cut-off events. [2025-03-13 21:48:46,639 INFO L125 PetriNetUnfolderBase]: For 12038/12042 co-relation queries the response was YES. [2025-03-13 21:48:46,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49402 conditions, 19614 events. 13221/19614 cut-off events. For 12038/12042 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 126071 event pairs, 2013 based on Foata normal form. 836/20388 useless extension candidates. Maximal degree in co-relation 39608. Up to 12269 conditions per place. [2025-03-13 21:48:46,740 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 83 selfloop transitions, 5 changer transitions 2/99 dead transitions. [2025-03-13 21:48:46,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 556 flow [2025-03-13 21:48:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-03-13 21:48:46,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49038461538461536 [2025-03-13 21:48:46,742 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 244 flow. Second operand 6 states and 153 transitions. [2025-03-13 21:48:46,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 556 flow [2025-03-13 21:48:46,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 534 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-13 21:48:46,862 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 220 flow [2025-03-13 21:48:46,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-03-13 21:48:46,863 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2025-03-13 21:48:46,863 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 220 flow [2025-03-13 21:48:46,863 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-03-13 21:48:46,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:46,863 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-03-13 21:48:46,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:48:46,863 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-03-13 21:48:46,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash 534944655, now seen corresponding path program 1 times [2025-03-13 21:48:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:46,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959344526] [2025-03-13 21:48:46,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:46,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:48:46,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:48:46,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:46,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:48:47,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:47,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959344526] [2025-03-13 21:48:47,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959344526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:47,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:47,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:47,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895350795] [2025-03-13 21:48:47,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:47,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:48:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:47,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:48:47,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:48:47,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2025-03-13 21:48:47,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 220 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-03-13 21:48:47,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:47,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2025-03-13 21:48:47,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:47,774 INFO L124 PetriNetUnfolderBase]: 9177/13344 cut-off events. [2025-03-13 21:48:47,775 INFO L125 PetriNetUnfolderBase]: For 9941/9951 co-relation queries the response was YES. [2025-03-13 21:48:47,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33597 conditions, 13344 events. 9177/13344 cut-off events. For 9941/9951 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 79995 event pairs, 1461 based on Foata normal form. 512/13828 useless extension candidates. Maximal degree in co-relation 28869. Up to 8719 conditions per place. [2025-03-13 21:48:47,828 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 84 selfloop transitions, 5 changer transitions 1/99 dead transitions. [2025-03-13 21:48:47,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 542 flow [2025-03-13 21:48:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-03-13 21:48:47,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967948717948718 [2025-03-13 21:48:47,829 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 220 flow. Second operand 6 states and 155 transitions. [2025-03-13 21:48:47,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 542 flow [2025-03-13 21:48:47,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 516 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-13 21:48:47,834 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 210 flow [2025-03-13 21:48:47,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-03-13 21:48:47,835 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-03-13 21:48:47,835 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 210 flow [2025-03-13 21:48:47,835 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-03-13 21:48:47,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:47,835 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-03-13 21:48:47,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:48:47,836 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-03-13 21:48:47,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash 149686050, now seen corresponding path program 1 times [2025-03-13 21:48:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:47,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934317070] [2025-03-13 21:48:47,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:47,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:47,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:48:47,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:48:47,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:47,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:48:47,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:48:47,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:48:47,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:48:47,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:47,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:48:47,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:48:47,925 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:48:47,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-03-13 21:48:47,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-03-13 21:48:47,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-13 21:48:47,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-13 21:48:47,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-13 21:48:47,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:48:47,928 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:48,013 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:48:48,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:48:48,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:48:48 BasicIcfg [2025-03-13 21:48:48,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:48:48,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:48:48,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:48:48,020 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:48:48,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:34" (3/4) ... [2025-03-13 21:48:48,022 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:48:48,104 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 76. [2025-03-13 21:48:48,165 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:48:48,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:48:48,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:48:48,166 INFO L158 Benchmark]: Toolchain (without parser) took 14538.55ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 124.0MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-13 21:48:48,166 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:48:48,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.51ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 110.8MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:48:48,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.83ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:48:48,167 INFO L158 Benchmark]: Boogie Preprocessor took 38.34ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 105.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:48:48,167 INFO L158 Benchmark]: IcfgBuilder took 822.16ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 76.9MB in the end (delta: 28.4MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2025-03-13 21:48:48,167 INFO L158 Benchmark]: TraceAbstraction took 13272.66ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 76.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-13 21:48:48,168 INFO L158 Benchmark]: Witness Printer took 145.65ms. Allocated memory is still 3.0GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 21:48:48,169 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.17ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.51ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 110.8MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.83ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.34ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 105.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 822.16ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 76.9MB in the end (delta: 28.4MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13272.66ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 76.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 145.65ms. Allocated memory is still 3.0GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. 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={-3: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={-3: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={-3: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={-3: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={-3:0}, q2_back=0, q2_front=0, t1=-1, 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={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, 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={-3: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={-3: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={-3: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={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, total=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=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, 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={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, t4=2, 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={-3: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={-3: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={-3: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; [L49] 1 _Bool cond = i < N; 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={-3:0}, q2_back=1, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=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={-3: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={-3: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={-3:0}, q2_back=1, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 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={-3: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={-3: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={-3: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={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, 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={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, 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={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, 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={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, 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={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, 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: 13.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1070 IncrementalHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2 mSDtfsCounter, 1070 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=6, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 10/10 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-03-13 21:48:48,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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