./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 735b3cc8 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-?-735b3cc-m [2025-03-14 01:04:47,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:04:47,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:04:47,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:04:47,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:04:47,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:04:47,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:04:47,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:04:47,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:04:47,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:04:47,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:04:47,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:04:47,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:04:47,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:04:47,487 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:04:47,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:04:47,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:04:47,487 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:04:47,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:04:47,488 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:04:47,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:04:47,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:04:47,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:04:47,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:04:47,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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-14 01:04:47,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:04:47,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:04:47,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:04:47,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:04:47,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:04:47,712 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-14 01:04:48,829 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edb1dde83/b2d479635b674dfea0a1c5740a568de7/FLAG77718ec48 [2025-03-14 01:04:49,058 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:04:49,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-14 01:04:49,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edb1dde83/b2d479635b674dfea0a1c5740a568de7/FLAG77718ec48 [2025-03-14 01:04:49,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edb1dde83/b2d479635b674dfea0a1c5740a568de7 [2025-03-14 01:04:49,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:04:49,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:04:49,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:04:49,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:04:49,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:04:49,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d2d9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49, skipping insertion in model container [2025-03-14 01:04:49,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:04:49,612 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-14 01:04:49,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:04:49,635 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:04:49,660 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-14 01:04:49,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:04:49,674 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:04:49,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49 WrapperNode [2025-03-14 01:04:49,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:04:49,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:04:49,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:04:49,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:04:49,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,723 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-03-14 01:04:49,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:04:49,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:04:49,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:04:49,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:04:49,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,757 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-14 01:04:49,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:04:49,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:04:49,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:04:49,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:04:49,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (1/1) ... [2025-03-14 01:04:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:04:49,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:49,798 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-14 01:04:49,800 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-14 01:04:49,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:04:49,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:04:49,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:04:49,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:04:49,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 01:04:49,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:04:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:04:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:04:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:04:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:04:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:04:49,823 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:04:49,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:04:49,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:04:50,378 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:04:50,379 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:04:50,379 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:04:50,706 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:04:50,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:04:50 BoogieIcfgContainer [2025-03-14 01:04:50,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:04:50,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:04:50,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:04:50,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:04:50,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:04:49" (1/3) ... [2025-03-14 01:04:50,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46999140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:04:50, skipping insertion in model container [2025-03-14 01:04:50,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:49" (2/3) ... [2025-03-14 01:04:50,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46999140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:04:50, skipping insertion in model container [2025-03-14 01:04:50,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:04:50" (3/3) ... [2025-03-14 01:04:50,716 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-03-14 01:04:50,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:04:50,731 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-14 01:04:50,731 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:04:50,794 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:04:50,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 128 flow [2025-03-14 01:04:50,859 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2025-03-14 01:04:50,861 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:04:50,869 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-14 01:04:50,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 128 flow [2025-03-14 01:04:50,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 114 flow [2025-03-14 01:04:50,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:04:50,892 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;@400895af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:04:50,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 01:04:50,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:04:50,914 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-03-14 01:04:50,914 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:04:50,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:50,915 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-14 01:04:50,915 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-14 01:04:50,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1705297120, now seen corresponding path program 1 times [2025-03-14 01:04:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:50,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898262863] [2025-03-14 01:04:50,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:50,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:04:51,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:04:51,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:51,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:51,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:51,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898262863] [2025-03-14 01:04:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898262863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:04:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902024429] [2025-03-14 01:04:51,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:51,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:04:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:51,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:04:51,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:04:51,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-14 01:04:51,699 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-14 01:04:51,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:51,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-14 01:04:51,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:52,835 INFO L124 PetriNetUnfolderBase]: 6847/9607 cut-off events. [2025-03-14 01:04:52,836 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-14 01:04:52,854 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-14 01:04:52,896 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 92 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2025-03-14 01:04:52,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 471 flow [2025-03-14 01:04:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:04:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:04:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2025-03-14 01:04:52,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5966666666666667 [2025-03-14 01:04:52,908 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 114 flow. Second operand 6 states and 179 transitions. [2025-03-14 01:04:52,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 108 transitions, 471 flow [2025-03-14 01:04:52,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 108 transitions, 433 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:04:52,929 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 145 flow [2025-03-14 01:04:52,931 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-14 01:04:52,935 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-14 01:04:52,935 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 145 flow [2025-03-14 01:04:52,935 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-14 01:04:52,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:52,936 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-14 01:04:52,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:04:52,936 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-14 01:04:52,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash 687208092, now seen corresponding path program 1 times [2025-03-14 01:04:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671102812] [2025-03-14 01:04:52,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:52,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:04:52,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:04:52,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:52,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:53,117 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-14 01:04:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:53,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671102812] [2025-03-14 01:04:53,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671102812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:53,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:04:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364372147] [2025-03-14 01:04:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:53,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:04:53,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:53,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:04:53,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:04:53,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-14 01:04:53,120 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-14 01:04:53,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:53,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-14 01:04:53,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:53,768 INFO L124 PetriNetUnfolderBase]: 5993/8325 cut-off events. [2025-03-14 01:04:53,768 INFO L125 PetriNetUnfolderBase]: For 2869/2869 co-relation queries the response was YES. [2025-03-14 01:04:53,780 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-14 01:04:53,813 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 57 selfloop transitions, 2 changer transitions 3/71 dead transitions. [2025-03-14 01:04:53,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 320 flow [2025-03-14 01:04:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:04:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:04:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-14 01:04:53,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-03-14 01:04:53,817 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 145 flow. Second operand 3 states and 97 transitions. [2025-03-14 01:04:53,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 320 flow [2025-03-14 01:04:53,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:04:53,848 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 152 flow [2025-03-14 01:04:53,849 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-14 01:04:53,849 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-14 01:04:53,850 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 152 flow [2025-03-14 01:04:53,850 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-14 01:04:53,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:53,851 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-14 01:04:53,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:04:53,851 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-14 01:04:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1560907721, now seen corresponding path program 1 times [2025-03-14 01:04:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721785729] [2025-03-14 01:04:53,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:53,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:04:53,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:04:53,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:53,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:54,077 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-14 01:04:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721785729] [2025-03-14 01:04:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721785729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:04:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086663751] [2025-03-14 01:04:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:54,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:04:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:54,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:04:54,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:04:54,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-14 01:04:54,086 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-14 01:04:54,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:54,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-14 01:04:54,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:55,577 INFO L124 PetriNetUnfolderBase]: 13647/18778 cut-off events. [2025-03-14 01:04:55,577 INFO L125 PetriNetUnfolderBase]: For 7002/7002 co-relation queries the response was YES. [2025-03-14 01:04:55,621 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-14 01:04:55,691 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 101 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2025-03-14 01:04:55,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 593 flow [2025-03-14 01:04:55,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:04:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:04:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2025-03-14 01:04:55,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-14 01:04:55,693 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 152 flow. Second operand 6 states and 183 transitions. [2025-03-14 01:04:55,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 593 flow [2025-03-14 01:04:55,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:04:55,705 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 269 flow [2025-03-14 01:04:55,706 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-14 01:04:55,706 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-14 01:04:55,706 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 269 flow [2025-03-14 01:04:55,707 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-14 01:04:55,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:55,707 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-14 01:04:55,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:04:55,707 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-14 01:04:55,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1224206051, now seen corresponding path program 1 times [2025-03-14 01:04:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67623640] [2025-03-14 01:04:55,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:55,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:04:55,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:04:55,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:55,883 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-14 01:04:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:55,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67623640] [2025-03-14 01:04:55,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67623640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:55,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:55,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:04:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025439785] [2025-03-14 01:04:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:55,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:04:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:55,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:04:55,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:04:55,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-14 01:04:55,885 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-14 01:04:55,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:55,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-14 01:04:55,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:57,056 INFO L124 PetriNetUnfolderBase]: 14586/20303 cut-off events. [2025-03-14 01:04:57,057 INFO L125 PetriNetUnfolderBase]: For 27353/27353 co-relation queries the response was YES. [2025-03-14 01:04:57,102 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-14 01:04:57,180 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 51 selfloop transitions, 2 changer transitions 27/89 dead transitions. [2025-03-14 01:04:57,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 511 flow [2025-03-14 01:04:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:04:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:04:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-14 01:04:57,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-14 01:04:57,182 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 269 flow. Second operand 5 states and 130 transitions. [2025-03-14 01:04:57,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 511 flow [2025-03-14 01:04:57,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:04:57,243 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 284 flow [2025-03-14 01:04:57,244 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-14 01:04:57,244 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2025-03-14 01:04:57,245 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 284 flow [2025-03-14 01:04:57,245 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-14 01:04:57,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:57,245 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-14 01:04:57,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:04:57,245 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-14 01:04:57,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash 289956528, now seen corresponding path program 1 times [2025-03-14 01:04:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:57,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350702180] [2025-03-14 01:04:57,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:57,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:57,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:04:57,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:04:57,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:57,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:58,131 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-14 01:04:58,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350702180] [2025-03-14 01:04:58,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350702180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:04:58,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255620933] [2025-03-14 01:04:58,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:58,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:04:58,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:58,134 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-14 01:04:58,135 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-14 01:04:58,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:04:58,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:04:58,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:58,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:58,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-14 01:04:58,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:04:58,288 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-14 01:04:58,648 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-14 01:04:58,658 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-14 01:04:58,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:04:59,161 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-14 01:04:59,174 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-14 01:04:59,213 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-14 01:04:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255620933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:04:59,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:04:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-14 01:04:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12633637] [2025-03-14 01:04:59,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:04:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:04:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:59,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:04:59,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:04:59,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-14 01:04:59,215 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-14 01:04:59,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:59,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-14 01:04:59,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:05,096 INFO L124 PetriNetUnfolderBase]: 55007/76869 cut-off events. [2025-03-14 01:05:05,096 INFO L125 PetriNetUnfolderBase]: For 102356/102356 co-relation queries the response was YES. [2025-03-14 01:05:05,364 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-14 01:05:05,595 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 326 selfloop transitions, 61 changer transitions 17/413 dead transitions. [2025-03-14 01:05:05,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 413 transitions, 2472 flow [2025-03-14 01:05:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:05:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:05:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 591 transitions. [2025-03-14 01:05:05,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6221052631578947 [2025-03-14 01:05:05,597 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 284 flow. Second operand 19 states and 591 transitions. [2025-03-14 01:05:05,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 413 transitions, 2472 flow [2025-03-14 01:05:05,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 413 transitions, 2438 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-14 01:05:05,836 INFO L231 Difference]: Finished difference. Result has 87 places, 121 transitions, 855 flow [2025-03-14 01:05:05,837 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-14 01:05:05,837 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2025-03-14 01:05:05,837 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 121 transitions, 855 flow [2025-03-14 01:05:05,837 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-14 01:05:05,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:05,838 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-14 01:05:05,844 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-14 01:05:06,038 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-14 01:05:06,038 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-14 01:05:06,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2119636620, now seen corresponding path program 1 times [2025-03-14 01:05:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577962286] [2025-03-14 01:05:06,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:06,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:05:06,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:05:06,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:06,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:06,804 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-14 01:05:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577962286] [2025-03-14 01:05:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577962286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258781821] [2025-03-14 01:05:06,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:06,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:06,811 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-14 01:05:06,813 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-14 01:05:06,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:05:06,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:05:06,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:06,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:06,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:05:06,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:07,086 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-14 01:05:07,094 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-14 01:05:07,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:07,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:05:07,189 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-14 01:05:07,367 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-14 01:05:07,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258781821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:07,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:07,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2025-03-14 01:05:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932459434] [2025-03-14 01:05:07,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:07,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:05:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:07,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:05:07,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:05:07,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-14 01:05:07,369 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-14 01:05:07,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:07,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-14 01:05:07,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:19,868 INFO L124 PetriNetUnfolderBase]: 104012/144963 cut-off events. [2025-03-14 01:05:19,868 INFO L125 PetriNetUnfolderBase]: For 322836/322836 co-relation queries the response was YES. [2025-03-14 01:05:20,566 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-14 01:05:21,215 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 302 selfloop transitions, 115 changer transitions 11/437 dead transitions. [2025-03-14 01:05:21,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 437 transitions, 3120 flow [2025-03-14 01:05:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:05:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:05:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 553 transitions. [2025-03-14 01:05:21,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5821052631578948 [2025-03-14 01:05:21,218 INFO L175 Difference]: Start difference. First operand has 87 places, 121 transitions, 855 flow. Second operand 19 states and 553 transitions. [2025-03-14 01:05:21,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 437 transitions, 3120 flow [2025-03-14 01:05:22,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 437 transitions, 3080 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:22,471 INFO L231 Difference]: Finished difference. Result has 109 places, 197 transitions, 1843 flow [2025-03-14 01:05:22,472 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-14 01:05:22,472 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2025-03-14 01:05:22,472 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 197 transitions, 1843 flow [2025-03-14 01:05:22,472 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-14 01:05:22,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:22,472 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-14 01:05:22,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:05:22,673 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-14 01:05:22,673 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-14 01:05:22,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1728600772, now seen corresponding path program 1 times [2025-03-14 01:05:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643332192] [2025-03-14 01:05:22,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:22,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:05:22,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:05:22,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:22,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:22,756 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-14 01:05:22,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:22,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643332192] [2025-03-14 01:05:22,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643332192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:22,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:22,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:05:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000076916] [2025-03-14 01:05:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:22,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:05:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:22,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:05:22,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:05:22,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-14 01:05:22,758 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-14 01:05:22,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:22,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-14 01:05:22,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand