./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.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-bad-buffer-mult-alt.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 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:45:58,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:45:58,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:45:58,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:45:58,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:45:58,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:45:58,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:45:58,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:45:58,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:45:58,268 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:45:58,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:45:58,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:45:58,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:45:58,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:45:58,269 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:45:58,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:45:58,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:45:58,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:45:58,271 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:45:58,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:45:58,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:45:58,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:45:58,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:45:58,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:45:58,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:45:58,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:45:58,272 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 -> 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f [2025-03-13 21:45:58,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:45:58,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:45:58,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:45:58,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:45:58,502 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:45:58,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-13 21:45:59,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b2ba06f/f4ee8567c6534311ac6edb73ae1ae0ca/FLAG6de8925d4 [2025-03-13 21:45:59,899 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:45:59,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-13 21:45:59,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b2ba06f/f4ee8567c6534311ac6edb73ae1ae0ca/FLAG6de8925d4 [2025-03-13 21:45:59,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b2ba06f/f4ee8567c6534311ac6edb73ae1ae0ca [2025-03-13 21:45:59,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:45:59,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:45:59,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:45:59,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:45:59,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:45:59,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:45:59" (1/1) ... [2025-03-13 21:45:59,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b84aff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:45:59, skipping insertion in model container [2025-03-13 21:45:59,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:45:59" (1/1) ... [2025-03-13 21:45:59,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:46:00,092 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-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-03-13 21:46:00,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:46:00,112 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:46:00,132 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-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-03-13 21:46:00,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:46:00,145 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:46:00,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00 WrapperNode [2025-03-13 21:46:00,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:46:00,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:46:00,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:46:00,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:46:00,153 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:46:00" (1/1) ... [2025-03-13 21:46:00,159 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:46:00" (1/1) ... [2025-03-13 21:46:00,180 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-03-13 21:46:00,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:46:00,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:46:00,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:46:00,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:46:00,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,211 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-13 21:46:00,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:46:00,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:46:00,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:46:00,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:46:00,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (1/1) ... [2025-03-13 21:46:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:46:00,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:00,245 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:46:00,248 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:46:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:46:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:46:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:46:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:46:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:46:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:46:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:46:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:46:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:46:00,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:46:00,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:46:00,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:46:00,267 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:46:00,372 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:46:00,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:46:00,723 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:46:00,725 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:46:00,725 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:46:01,079 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:46:01,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:46:01 BoogieIcfgContainer [2025-03-13 21:46:01,080 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:46:01,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:46:01,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:46:01,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:46:01,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:45:59" (1/3) ... [2025-03-13 21:46:01,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167f9ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:46:01, skipping insertion in model container [2025-03-13 21:46:01,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:00" (2/3) ... [2025-03-13 21:46:01,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167f9ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:46:01, skipping insertion in model container [2025-03-13 21:46:01,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:46:01" (3/3) ... [2025-03-13 21:46:01,086 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-03-13 21:46:01,097 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:46:01,098 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-13 21:46:01,098 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:46:01,146 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:46:01,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 128 flow [2025-03-13 21:46:01,208 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2025-03-13 21:46:01,210 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:46:01,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 6/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-13 21:46:01,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 128 flow [2025-03-13 21:46:01,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 114 flow [2025-03-13 21:46:01,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:46:01,235 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;@3d204788, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:46:01,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:46:01,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:46:01,253 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-03-13 21:46:01,253 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:46:01,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:01,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:01,255 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:46:01,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1705297120, now seen corresponding path program 1 times [2025-03-13 21:46:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834670384] [2025-03-13 21:46:01,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:01,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:46:01,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:46:01,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:01,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:01,924 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:46:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834670384] [2025-03-13 21:46:01,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834670384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:01,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:01,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:46:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808199765] [2025-03-13 21:46:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:01,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:01,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:01,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:01,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:01,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:46:01,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:46:01,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:01,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:46:01,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:02,918 INFO L124 PetriNetUnfolderBase]: 6847/9607 cut-off events. [2025-03-13 21:46:02,919 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-13 21:46:02,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19212 conditions, 9607 events. 6847/9607 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 52755 event pairs, 453 based on Foata normal form. 448/10019 useless extension candidates. Maximal degree in co-relation 17454. Up to 5031 conditions per place. [2025-03-13 21:46:02,983 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 92 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2025-03-13 21:46:02,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 471 flow [2025-03-13 21:46:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:46:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:46:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2025-03-13 21:46:02,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5966666666666667 [2025-03-13 21:46:02,997 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 114 flow. Second operand 6 states and 179 transitions. [2025-03-13 21:46:02,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 108 transitions, 471 flow [2025-03-13 21:46:03,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 108 transitions, 433 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:46:03,018 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 145 flow [2025-03-13 21:46:03,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-03-13 21:46:03,025 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-13 21:46:03,025 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 145 flow [2025-03-13 21:46:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:46:03,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:03,027 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] [2025-03-13 21:46:03,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:46:03,028 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:46:03,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:03,029 INFO L85 PathProgramCache]: Analyzing trace with hash 687208092, now seen corresponding path program 1 times [2025-03-13 21:46:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521521392] [2025-03-13 21:46:03,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:03,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 21:46:03,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:46:03,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:03,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521521392] [2025-03-13 21:46:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521521392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:03,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583217391] [2025-03-13 21:46:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:03,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:03,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:03,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:03,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:46:03,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:03,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:03,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:46:03,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:03,791 INFO L124 PetriNetUnfolderBase]: 5993/8325 cut-off events. [2025-03-13 21:46:03,792 INFO L125 PetriNetUnfolderBase]: For 2869/2869 co-relation queries the response was YES. [2025-03-13 21:46:03,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19620 conditions, 8325 events. 5993/8325 cut-off events. For 2869/2869 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 43852 event pairs, 1181 based on Foata normal form. 159/8439 useless extension candidates. Maximal degree in co-relation 10019. Up to 6569 conditions per place. [2025-03-13 21:46:03,829 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 57 selfloop transitions, 2 changer transitions 3/71 dead transitions. [2025-03-13 21:46:03,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 320 flow [2025-03-13 21:46:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-13 21:46:03,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-03-13 21:46:03,831 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 145 flow. Second operand 3 states and 97 transitions. [2025-03-13 21:46:03,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 320 flow [2025-03-13 21:46:03,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:46:03,861 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 152 flow [2025-03-13 21:46:03,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=152, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-13 21:46:03,862 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-13 21:46:03,863 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 152 flow [2025-03-13 21:46:03,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:03,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:03,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] [2025-03-13 21:46:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:46:03,863 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:46:03,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1560907721, now seen corresponding path program 1 times [2025-03-13 21:46:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:03,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925608398] [2025-03-13 21:46:03,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:03,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:03,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:46:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:46:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:04,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925608398] [2025-03-13 21:46:04,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925608398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:04,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:04,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:46:04,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259005172] [2025-03-13 21:46:04,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:04,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:04,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:04,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:04,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:04,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:46:04,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:46:04,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:04,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:46:04,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:05,489 INFO L124 PetriNetUnfolderBase]: 13647/18778 cut-off events. [2025-03-13 21:46:05,489 INFO L125 PetriNetUnfolderBase]: For 7002/7002 co-relation queries the response was YES. [2025-03-13 21:46:05,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44743 conditions, 18778 events. 13647/18778 cut-off events. For 7002/7002 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 105722 event pairs, 2678 based on Foata normal form. 224/18890 useless extension candidates. Maximal degree in co-relation 13468. Up to 5966 conditions per place. [2025-03-13 21:46:05,590 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 101 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2025-03-13 21:46:05,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 593 flow [2025-03-13 21:46:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:46:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:46:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2025-03-13 21:46:05,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-13 21:46:05,592 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 152 flow. Second operand 6 states and 183 transitions. [2025-03-13 21:46:05,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 593 flow [2025-03-13 21:46:05,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:05,604 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 269 flow [2025-03-13 21:46:05,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2025-03-13 21:46:05,605 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-13 21:46:05,605 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 269 flow [2025-03-13 21:46:05,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:46:05,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:05,606 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] [2025-03-13 21:46:05,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:46:05,606 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:46:05,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1224206051, now seen corresponding path program 1 times [2025-03-13 21:46:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765176317] [2025-03-13 21:46:05,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:05,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:46:05,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:46:05,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:05,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:46:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:05,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765176317] [2025-03-13 21:46:05,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765176317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:05,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:05,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:05,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135061861] [2025-03-13 21:46:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:05,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:46:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:05,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:46:05,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:46:05,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:46:05,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:46:05,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:05,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:46:05,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:07,056 INFO L124 PetriNetUnfolderBase]: 14586/20303 cut-off events. [2025-03-13 21:46:07,056 INFO L125 PetriNetUnfolderBase]: For 27353/27353 co-relation queries the response was YES. [2025-03-13 21:46:07,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56883 conditions, 20303 events. 14586/20303 cut-off events. For 27353/27353 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 119050 event pairs, 9826 based on Foata normal form. 111/20290 useless extension candidates. Maximal degree in co-relation 20230. Up to 17841 conditions per place. [2025-03-13 21:46:07,181 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 51 selfloop transitions, 2 changer transitions 27/89 dead transitions. [2025-03-13 21:46:07,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 511 flow [2025-03-13 21:46:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-13 21:46:07,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-13 21:46:07,182 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 269 flow. Second operand 5 states and 130 transitions. [2025-03-13 21:46:07,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 511 flow [2025-03-13 21:46:07,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:07,248 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 284 flow [2025-03-13 21:46:07,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-03-13 21:46:07,249 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2025-03-13 21:46:07,249 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 284 flow [2025-03-13 21:46:07,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:46:07,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:07,249 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:46:07,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:46:07,249 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:46:07,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 289956528, now seen corresponding path program 1 times [2025-03-13 21:46:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:07,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94914996] [2025-03-13 21:46:07,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:07,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:07,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:46:07,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:46:07,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:07,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:08,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94914996] [2025-03-13 21:46:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94914996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131226296] [2025-03-13 21:46:08,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:08,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:08,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:46:08,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:46:08,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:46:08,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:46:08,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:08,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:08,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-13 21:46:08,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:08,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-13 21:46:08,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-13 21:46:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:08,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:46:09,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-03-13 21:46:09,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-13 21:46:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:09,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131226296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:46:09,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:46:09,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-13 21:46:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368078499] [2025-03-13 21:46:09,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:46:09,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:46:09,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:09,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:46:09,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:46:09,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:46:09,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 284 flow. Second operand has 18 states, 18 states have (on average 17.22222222222222) internal successors, (310), 18 states have internal predecessors, (310), 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:46:09,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:09,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:46:09,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:14,983 INFO L124 PetriNetUnfolderBase]: 55007/76869 cut-off events. [2025-03-13 21:46:14,983 INFO L125 PetriNetUnfolderBase]: For 102356/102356 co-relation queries the response was YES. [2025-03-13 21:46:15,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215124 conditions, 76869 events. 55007/76869 cut-off events. For 102356/102356 co-relation queries the response was YES. Maximal size of possible extension queue 2252. Compared 513076 event pairs, 4598 based on Foata normal form. 676/77395 useless extension candidates. Maximal degree in co-relation 215103. Up to 21770 conditions per place. [2025-03-13 21:46:15,585 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 326 selfloop transitions, 61 changer transitions 17/413 dead transitions. [2025-03-13 21:46:15,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 413 transitions, 2472 flow [2025-03-13 21:46:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:46:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:46:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 591 transitions. [2025-03-13 21:46:15,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6221052631578947 [2025-03-13 21:46:15,587 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 284 flow. Second operand 19 states and 591 transitions. [2025-03-13 21:46:15,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 413 transitions, 2472 flow [2025-03-13 21:46:15,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 413 transitions, 2438 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-13 21:46:15,791 INFO L231 Difference]: Finished difference. Result has 87 places, 121 transitions, 855 flow [2025-03-13 21:46:15,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=855, PETRI_PLACES=87, PETRI_TRANSITIONS=121} [2025-03-13 21:46:15,792 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2025-03-13 21:46:15,792 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 121 transitions, 855 flow [2025-03-13 21:46:15,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.22222222222222) internal successors, (310), 18 states have internal predecessors, (310), 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:46:15,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:15,793 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:15,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:46:15,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:15,993 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:46:15,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:15,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2119636620, now seen corresponding path program 1 times [2025-03-13 21:46:15,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:15,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838714737] [2025-03-13 21:46:15,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:15,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:16,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:46:16,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:46:16,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:16,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:16,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838714737] [2025-03-13 21:46:16,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838714737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630845000] [2025-03-13 21:46:16,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:16,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:16,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:16,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:46:16,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:46:16,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:46:16,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:46:16,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:16,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:16,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-13 21:46:16,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:17,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-13 21:46:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:46:17,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:46:17,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:46:17,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-13 21:46:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:46:17,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630845000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:46:17,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:46:17,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2025-03-13 21:46:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156450222] [2025-03-13 21:46:17,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:46:17,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:46:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:17,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:46:17,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:46:17,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:46:17,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 121 transitions, 855 flow. Second operand has 15 states, 15 states have (on average 18.066666666666666) internal successors, (271), 15 states have internal predecessors, (271), 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:46:17,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:17,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:46:17,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:29,437 INFO L124 PetriNetUnfolderBase]: 104012/144963 cut-off events. [2025-03-13 21:46:29,437 INFO L125 PetriNetUnfolderBase]: For 322836/322836 co-relation queries the response was YES. [2025-03-13 21:46:29,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449951 conditions, 144963 events. 104012/144963 cut-off events. For 322836/322836 co-relation queries the response was YES. Maximal size of possible extension queue 4343. Compared 1038186 event pairs, 9229 based on Foata normal form. 3/144764 useless extension candidates. Maximal degree in co-relation 374049. Up to 46041 conditions per place. [2025-03-13 21:46:30,654 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 302 selfloop transitions, 115 changer transitions 11/437 dead transitions. [2025-03-13 21:46:30,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 437 transitions, 3120 flow [2025-03-13 21:46:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:46:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:46:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 553 transitions. [2025-03-13 21:46:30,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5821052631578948 [2025-03-13 21:46:30,659 INFO L175 Difference]: Start difference. First operand has 87 places, 121 transitions, 855 flow. Second operand 19 states and 553 transitions. [2025-03-13 21:46:30,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 437 transitions, 3120 flow [2025-03-13 21:46:31,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 437 transitions, 3080 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:31,884 INFO L231 Difference]: Finished difference. Result has 109 places, 197 transitions, 1843 flow [2025-03-13 21:46:31,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1843, PETRI_PLACES=109, PETRI_TRANSITIONS=197} [2025-03-13 21:46:31,885 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2025-03-13 21:46:31,885 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 197 transitions, 1843 flow [2025-03-13 21:46:31,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.066666666666666) internal successors, (271), 15 states have internal predecessors, (271), 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:46:31,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:31,885 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] [2025-03-13 21:46:31,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:46:32,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-13 21:46:32,086 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:46:32,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1728600772, now seen corresponding path program 1 times [2025-03-13 21:46:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916458418] [2025-03-13 21:46:32,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:32,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:46:32,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:46:32,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:32,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:32,160 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:46:32,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:32,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916458418] [2025-03-13 21:46:32,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916458418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:32,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:32,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198705995] [2025-03-13 21:46:32,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:32,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:32,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:32,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:32,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:32,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:46:32,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 197 transitions, 1843 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:46:32,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:32,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:46:32,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand