./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-alt2.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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:40:29,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:40:29,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:40:29,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:40:29,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:40:29,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:40:29,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:40:29,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:40:29,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:40:29,133 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:40:29,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:40:29,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:40:29,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:40:29,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:40:29,133 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:40:29,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:40:29,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:40:29,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:40:29,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:40:29,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:40:29,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:40:29,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:40:29,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:40:29,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:40:29,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:40:29,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:40:29,135 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2025-03-17 06:40:29,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:40:29,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:40:29,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:40:29,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:40:29,355 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:40:29,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-03-17 06:40:30,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e030b0f6b/26356342d33d4c7395b73ab927eee3cc/FLAG0092e848e [2025-03-17 06:40:30,711 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:40:30,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-03-17 06:40:30,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e030b0f6b/26356342d33d4c7395b73ab927eee3cc/FLAG0092e848e [2025-03-17 06:40:31,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e030b0f6b/26356342d33d4c7395b73ab927eee3cc [2025-03-17 06:40:31,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:40:31,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:40:31,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:40:31,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:40:31,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:40:31,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752f4255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31, skipping insertion in model container [2025-03-17 06:40:31,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:40:31,189 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-alt2.wvr.c[4226,4239] [2025-03-17 06:40:31,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:40:31,210 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:40:31,234 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-alt2.wvr.c[4226,4239] [2025-03-17 06:40:31,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:40:31,256 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:40:31,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31 WrapperNode [2025-03-17 06:40:31,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:40:31,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:40:31,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:40:31,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:40:31,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,297 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 289 [2025-03-17 06:40:31,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:40:31,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:40:31,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:40:31,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:40:31,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,325 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-17 06:40:31,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:40:31,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:40:31,342 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:40:31,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:40:31,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (1/1) ... [2025-03-17 06:40:31,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:40:31,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:31,366 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-17 06:40:31,368 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-17 06:40:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:40:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:40:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:40:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:40:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:40:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:40:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:40:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 06:40:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 06:40:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:40:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:40:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:40:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:40:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:40:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:40:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:40:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:40:31,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:40:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:40:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:40:31,389 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:40:31,461 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:40:31,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:40:31,797 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:40:31,797 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:40:32,021 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:40:32,021 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:40:32,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:40:32 BoogieIcfgContainer [2025-03-17 06:40:32,022 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:40:32,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:40:32,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:40:32,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:40:32,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:40:31" (1/3) ... [2025-03-17 06:40:32,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d5b631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:40:32, skipping insertion in model container [2025-03-17 06:40:32,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:31" (2/3) ... [2025-03-17 06:40:32,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d5b631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:40:32, skipping insertion in model container [2025-03-17 06:40:32,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:40:32" (3/3) ... [2025-03-17 06:40:32,028 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-03-17 06:40:32,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:40:32,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-17 06:40:32,040 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:40:32,088 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 06:40:32,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 124 flow [2025-03-17 06:40:32,146 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-03-17 06:40:32,150 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:40:32,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 6/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-17 06:40:32,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 48 transitions, 124 flow [2025-03-17 06:40:32,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 43 transitions, 110 flow [2025-03-17 06:40:32,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:40:32,179 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;@6bcb5836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:40:32,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 06:40:32,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:40:32,195 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-03-17 06:40:32,196 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:40:32,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:32,196 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-17 06:40:32,197 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-17 06:40:32,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 287441254, now seen corresponding path program 1 times [2025-03-17 06:40:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:32,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058101844] [2025-03-17 06:40:32,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:32,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 06:40:32,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:40:32,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:32,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:32,875 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-17 06:40:32,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:32,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058101844] [2025-03-17 06:40:32,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058101844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:32,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:32,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:40:32,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969361421] [2025-03-17 06:40:32,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:32,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:40:32,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:32,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:40:32,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:40:32,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-17 06:40:32,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 110 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-17 06:40:32,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:32,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-17 06:40:32,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:33,475 INFO L124 PetriNetUnfolderBase]: 3041/4354 cut-off events. [2025-03-17 06:40:33,476 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-03-17 06:40:33,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8637 conditions, 4354 events. 3041/4354 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 22375 event pairs, 279 based on Foata normal form. 170/4496 useless extension candidates. Maximal degree in co-relation 8425. Up to 2681 conditions per place. [2025-03-17 06:40:33,513 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 69 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2025-03-17 06:40:33,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 352 flow [2025-03-17 06:40:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:40:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:40:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-17 06:40:33,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2025-03-17 06:40:33,525 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 110 flow. Second operand 5 states and 139 transitions. [2025-03-17 06:40:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 352 flow [2025-03-17 06:40:33,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 82 transitions, 324 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 06:40:33,536 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 110 flow [2025-03-17 06:40:33,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-17 06:40:33,540 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-17 06:40:33,540 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 110 flow [2025-03-17 06:40:33,540 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-17 06:40:33,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:33,541 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-17 06:40:33,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:40:33,541 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-17 06:40:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1124780015, now seen corresponding path program 1 times [2025-03-17 06:40:33,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:33,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265246647] [2025-03-17 06:40:33,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:33,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 06:40:33,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 06:40:33,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:33,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:40:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265246647] [2025-03-17 06:40:33,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265246647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:33,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:33,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:40:33,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911998589] [2025-03-17 06:40:33,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:33,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:40:33,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:33,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:40:33,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:40:33,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-17 06:40:33,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-17 06:40:33,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:33,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-17 06:40:33,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:34,402 INFO L124 PetriNetUnfolderBase]: 4513/6331 cut-off events. [2025-03-17 06:40:34,402 INFO L125 PetriNetUnfolderBase]: For 1418/1418 co-relation queries the response was YES. [2025-03-17 06:40:34,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13625 conditions, 6331 events. 4513/6331 cut-off events. For 1418/1418 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 32592 event pairs, 439 based on Foata normal form. 220/6537 useless extension candidates. Maximal degree in co-relation 2170. Up to 3837 conditions per place. [2025-03-17 06:40:34,430 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 80 selfloop transitions, 7 changer transitions 0/96 dead transitions. [2025-03-17 06:40:34,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 417 flow [2025-03-17 06:40:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:40:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:40:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-03-17 06:40:34,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-03-17 06:40:34,432 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 110 flow. Second operand 6 states and 165 transitions. [2025-03-17 06:40:34,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 96 transitions, 417 flow [2025-03-17 06:40:34,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 405 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:40:34,434 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 155 flow [2025-03-17 06:40:34,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2025-03-17 06:40:34,434 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-17 06:40:34,435 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 155 flow [2025-03-17 06:40:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-17 06:40:34,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:34,435 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-17 06:40:34,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:40:34,435 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-17 06:40:34,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1426762875, now seen corresponding path program 2 times [2025-03-17 06:40:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923473453] [2025-03-17 06:40:34,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:40:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:34,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 06:40:34,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 06:40:34,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:40:34,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:34,605 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-17 06:40:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:34,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923473453] [2025-03-17 06:40:34,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923473453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:34,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:34,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:40:34,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782662904] [2025-03-17 06:40:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:34,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:40:34,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:34,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:40:34,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:40:34,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-17 06:40:34,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-17 06:40:34,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:34,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-17 06:40:34,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:35,441 INFO L124 PetriNetUnfolderBase]: 7765/10764 cut-off events. [2025-03-17 06:40:35,442 INFO L125 PetriNetUnfolderBase]: For 4904/4904 co-relation queries the response was YES. [2025-03-17 06:40:35,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26373 conditions, 10764 events. 7765/10764 cut-off events. For 4904/4904 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 58709 event pairs, 2166 based on Foata normal form. 140/10822 useless extension candidates. Maximal degree in co-relation 7124. Up to 4606 conditions per place. [2025-03-17 06:40:35,497 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 90 selfloop transitions, 12 changer transitions 0/111 dead transitions. [2025-03-17 06:40:35,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 525 flow [2025-03-17 06:40:35,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:40:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:40:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-03-17 06:40:35,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076388888888888 [2025-03-17 06:40:35,499 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 155 flow. Second operand 6 states and 175 transitions. [2025-03-17 06:40:35,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 525 flow [2025-03-17 06:40:35,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:40:35,503 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 239 flow [2025-03-17 06:40:35,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-17 06:40:35,504 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-03-17 06:40:35,504 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 239 flow [2025-03-17 06:40:35,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-17 06:40:35,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:35,504 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] [2025-03-17 06:40:35,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:40:35,505 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-17 06:40:35,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:35,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1539851636, now seen corresponding path program 1 times [2025-03-17 06:40:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:35,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729736877] [2025-03-17 06:40:35,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:35,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:35,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 06:40:35,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 06:40:35,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:35,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:35,653 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-17 06:40:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729736877] [2025-03-17 06:40:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729736877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:35,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:35,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:40:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635367601] [2025-03-17 06:40:35,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:35,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:40:35,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:35,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:40:35,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:40:35,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-17 06:40:35,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 239 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-17 06:40:35,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:35,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-17 06:40:35,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:36,469 INFO L124 PetriNetUnfolderBase]: 8177/11343 cut-off events. [2025-03-17 06:40:36,470 INFO L125 PetriNetUnfolderBase]: For 17209/17209 co-relation queries the response was YES. [2025-03-17 06:40:36,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32460 conditions, 11343 events. 8177/11343 cut-off events. For 17209/17209 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 62090 event pairs, 5641 based on Foata normal form. 161/11391 useless extension candidates. Maximal degree in co-relation 20844. Up to 10131 conditions per place. [2025-03-17 06:40:36,523 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 46 selfloop transitions, 2 changer transitions 21/78 dead transitions. [2025-03-17 06:40:36,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 436 flow [2025-03-17 06:40:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:40:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:40:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-17 06:40:36,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-03-17 06:40:36,525 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 239 flow. Second operand 4 states and 110 transitions. [2025-03-17 06:40:36,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 436 flow [2025-03-17 06:40:36,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 428 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 06:40:36,553 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 250 flow [2025-03-17 06:40:36,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-03-17 06:40:36,555 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2025-03-17 06:40:36,555 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 250 flow [2025-03-17 06:40:36,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-17 06:40:36,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:36,555 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-17 06:40:36,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:40:36,556 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-17 06:40:36,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:36,556 INFO L85 PathProgramCache]: Analyzing trace with hash 949299620, now seen corresponding path program 1 times [2025-03-17 06:40:36,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:36,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385623327] [2025-03-17 06:40:36,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:36,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:36,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:40:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:40:36,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:36,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:37,320 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-17 06:40:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385623327] [2025-03-17 06:40:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385623327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829648798] [2025-03-17 06:40:37,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:37,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:37,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:37,323 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-17 06:40:37,325 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-17 06:40:37,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:40:37,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:40:37,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:37,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:37,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 06:40:37,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:40:37,480 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-17 06:40:37,723 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-17 06:40:37,743 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-17 06:40:37,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:40:38,099 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-17 06:40:38,105 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-17 06:40:38,162 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-17 06:40:38,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829648798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:40:38,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:40:38,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-17 06:40:38,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622164329] [2025-03-17 06:40:38,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:40:38,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:40:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:38,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:40:38,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:40:38,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-17 06:40:38,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 250 flow. Second operand has 18 states, 18 states have (on average 16.166666666666668) internal successors, (291), 18 states have internal predecessors, (291), 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-17 06:40:38,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:38,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-17 06:40:38,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:42,571 INFO L124 PetriNetUnfolderBase]: 33233/46836 cut-off events. [2025-03-17 06:40:42,571 INFO L125 PetriNetUnfolderBase]: For 61523/61523 co-relation queries the response was YES. [2025-03-17 06:40:42,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130289 conditions, 46836 events. 33233/46836 cut-off events. For 61523/61523 co-relation queries the response was YES. Maximal size of possible extension queue 1756. Compared 307984 event pairs, 2830 based on Foata normal form. 340/47051 useless extension candidates. Maximal degree in co-relation 130269. Up to 12417 conditions per place. [2025-03-17 06:40:42,884 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 359 selfloop transitions, 71 changer transitions 11/450 dead transitions. [2025-03-17 06:40:42,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 450 transitions, 2611 flow [2025-03-17 06:40:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 06:40:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 06:40:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 708 transitions. [2025-03-17 06:40:42,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-03-17 06:40:42,887 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 250 flow. Second operand 24 states and 708 transitions. [2025-03-17 06:40:42,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 450 transitions, 2611 flow [2025-03-17 06:40:43,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 450 transitions, 2575 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-03-17 06:40:43,067 INFO L231 Difference]: Finished difference. Result has 92 places, 128 transitions, 890 flow [2025-03-17 06:40:43,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=890, PETRI_PLACES=92, PETRI_TRANSITIONS=128} [2025-03-17 06:40:43,068 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2025-03-17 06:40:43,068 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 128 transitions, 890 flow [2025-03-17 06:40:43,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.166666666666668) internal successors, (291), 18 states have internal predecessors, (291), 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-17 06:40:43,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:43,069 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] [2025-03-17 06:40:43,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:40:43,269 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-17 06:40:43,270 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-17 06:40:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1260780027, now seen corresponding path program 1 times [2025-03-17 06:40:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750837538] [2025-03-17 06:40:43,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:43,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 06:40:43,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 06:40:43,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:43,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:40:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750837538] [2025-03-17 06:40:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750837538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940267834] [2025-03-17 06:40:44,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:44,008 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-17 06:40:44,010 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-17 06:40:44,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 06:40:44,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 06:40:44,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:44,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:44,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 06:40:44,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:40:44,251 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 23 treesize of output 7 [2025-03-17 06:40:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:40:44,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:40:44,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:40:44,304 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-17 06:40:44,391 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-17 06:40:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940267834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:40:44,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:40:44,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 14 [2025-03-17 06:40:44,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585635182] [2025-03-17 06:40:44,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:40:44,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:40:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:44,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:40:44,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:40:44,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-17 06:40:44,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 128 transitions, 890 flow. Second operand has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 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-17 06:40:44,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:44,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-17 06:40:44,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:49,204 INFO L124 PetriNetUnfolderBase]: 43671/62196 cut-off events. [2025-03-17 06:40:49,204 INFO L125 PetriNetUnfolderBase]: For 127877/127877 co-relation queries the response was YES. [2025-03-17 06:40:49,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189330 conditions, 62196 events. 43671/62196 cut-off events. For 127877/127877 co-relation queries the response was YES. Maximal size of possible extension queue 2285. Compared 430372 event pairs, 5138 based on Foata normal form. 226/62298 useless extension candidates. Maximal degree in co-relation 164378. Up to 27876 conditions per place. [2025-03-17 06:40:49,770 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 160 selfloop transitions, 75 changer transitions 1/245 dead transitions. [2025-03-17 06:40:49,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 245 transitions, 1890 flow [2025-03-17 06:40:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:40:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 06:40:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 323 transitions. [2025-03-17 06:40:49,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4806547619047619 [2025-03-17 06:40:49,772 INFO L175 Difference]: Start difference. First operand has 92 places, 128 transitions, 890 flow. Second operand 14 states and 323 transitions. [2025-03-17 06:40:49,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 245 transitions, 1890 flow [2025-03-17 06:40:50,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 245 transitions, 1854 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-03-17 06:40:50,607 INFO L231 Difference]: Finished difference. Result has 108 places, 155 transitions, 1319 flow [2025-03-17 06:40:50,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1319, PETRI_PLACES=108, PETRI_TRANSITIONS=155} [2025-03-17 06:40:50,608 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 58 predicate places. [2025-03-17 06:40:50,608 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 155 transitions, 1319 flow [2025-03-17 06:40:50,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 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-17 06:40:50,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:50,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:50,616 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-17 06:40:50,809 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-17 06:40:50,809 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-17 06:40:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 818615981, now seen corresponding path program 1 times [2025-03-17 06:40:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:50,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438286346] [2025-03-17 06:40:50,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:50,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 06:40:50,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 06:40:50,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:50,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:50,888 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-17 06:40:50,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:50,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438286346] [2025-03-17 06:40:50,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438286346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:50,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:50,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:40:50,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690332560] [2025-03-17 06:40:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:50,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:40:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:50,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:40:50,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:40:50,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-17 06:40:50,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 155 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:50,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:50,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-17 06:40:50,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:57,485 INFO L124 PetriNetUnfolderBase]: 56181/80406 cut-off events. [2025-03-17 06:40:57,485 INFO L125 PetriNetUnfolderBase]: For 234412/234412 co-relation queries the response was YES. [2025-03-17 06:40:57,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255768 conditions, 80406 events. 56181/80406 cut-off events. For 234412/234412 co-relation queries the response was YES. Maximal size of possible extension queue 2692. Compared 579515 event pairs, 19690 based on Foata normal form. 1740/82056 useless extension candidates. Maximal degree in co-relation 227353. Up to 45702 conditions per place. [2025-03-17 06:40:58,180 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 210 selfloop transitions, 9 changer transitions 0/228 dead transitions. [2025-03-17 06:40:58,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 228 transitions, 2484 flow [2025-03-17 06:40:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:40:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:40:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-17 06:40:58,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-17 06:40:58,181 INFO L175 Difference]: Start difference. First operand has 108 places, 155 transitions, 1319 flow. Second operand 3 states and 96 transitions. [2025-03-17 06:40:58,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 228 transitions, 2484 flow [2025-03-17 06:40:58,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 228 transitions, 2450 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-17 06:40:58,895 INFO L231 Difference]: Finished difference. Result has 108 places, 156 transitions, 1366 flow [2025-03-17 06:40:58,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=108, PETRI_TRANSITIONS=156} [2025-03-17 06:40:58,896 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 58 predicate places. [2025-03-17 06:40:58,896 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 156 transitions, 1366 flow [2025-03-17 06:40:58,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:58,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:58,896 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:58,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:40:58,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-17 06:40:58,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1746228441, now seen corresponding path program 2 times [2025-03-17 06:40:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:58,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856110361] [2025-03-17 06:40:58,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:40:58,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:58,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 06:40:58,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 06:40:58,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:40:58,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:59,120 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-17 06:40:59,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:59,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856110361] [2025-03-17 06:40:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856110361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:40:59,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351404354] [2025-03-17 06:40:59,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:59,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:40:59,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:59,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:40:59,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:40:59,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-17 06:40:59,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 156 transitions, 1366 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-17 06:40:59,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:59,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-17 06:40:59,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand