./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:40:04,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:40:04,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:40:04,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:40:04,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:40:04,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:40:04,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:40:04,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:40:04,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:40:04,093 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:40:04,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:40:04,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:40:04,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:40:04,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:40:04,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:40:04,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:40:04,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:40:04,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b [2025-02-06 04:40:04,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:40:04,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:40:04,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:40:04,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:40:04,347 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:40:04,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-02-06 04:40:05,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8182dd6ac/da1bfddd611d4166a524b998f071f250/FLAGb27323c93 [2025-02-06 04:40:05,711 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:40:05,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-02-06 04:40:05,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8182dd6ac/da1bfddd611d4166a524b998f071f250/FLAGb27323c93 [2025-02-06 04:40:06,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8182dd6ac/da1bfddd611d4166a524b998f071f250 [2025-02-06 04:40:06,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:40:06,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:40:06,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:40:06,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:40:06,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:40:06,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f77c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06, skipping insertion in model container [2025-02-06 04:40:06,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:40:06,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c[4270,4283] [2025-02-06 04:40:06,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:40:06,189 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:40:06,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c[4270,4283] [2025-02-06 04:40:06,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:40:06,227 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:40:06,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06 WrapperNode [2025-02-06 04:40:06,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:40:06,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:40:06,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:40:06,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:40:06,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,266 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 278 [2025-02-06 04:40:06,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:40:06,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:40:06,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:40:06,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:40:06,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,299 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-02-06 04:40:06,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,309 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:40:06,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:40:06,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:40:06,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:40:06,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (1/1) ... [2025-02-06 04:40:06,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:40:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:40:06,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:40:06,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:40:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:40:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:40:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 04:40:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:40:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:40:06,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:40:06,371 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:40:06,453 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:40:06,454 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:40:06,791 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:40:06,791 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:40:06,984 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:40:06,985 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:40:06,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:06 BoogieIcfgContainer [2025-02-06 04:40:06,985 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:40:06,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:40:06,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:40:06,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:40:06,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:40:06" (1/3) ... [2025-02-06 04:40:06,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b6dbec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:06, skipping insertion in model container [2025-02-06 04:40:06,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:06" (2/3) ... [2025-02-06 04:40:06,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b6dbec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:06, skipping insertion in model container [2025-02-06 04:40:06,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:06" (3/3) ... [2025-02-06 04:40:06,991 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult3.wvr.c [2025-02-06 04:40:07,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:40:07,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult3.wvr.c that has 5 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-06 04:40:07,003 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:40:07,046 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 04:40:07,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 128 flow [2025-02-06 04:40:07,090 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2025-02-06 04:40:07,092 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:40:07,094 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 87 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-02-06 04:40:07,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 128 flow [2025-02-06 04:40:07,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 114 flow [2025-02-06 04:40:07,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:40:07,119 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;@18a1415a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:40:07,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:40:07,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:40:07,135 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-02-06 04:40:07,135 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:40:07,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:07,136 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-02-06 04:40:07,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:07,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2018356736, now seen corresponding path program 1 times [2025-02-06 04:40:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:07,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497296770] [2025-02-06 04:40:07,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:07,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:07,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:40:07,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:40:07,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:07,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:07,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:07,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497296770] [2025-02-06 04:40:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497296770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:07,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:07,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119951269] [2025-02-06 04:40:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:07,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:07,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:07,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:07,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 04:40:07,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:07,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:07,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 04:40:07,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:08,195 INFO L124 PetriNetUnfolderBase]: 5628/7732 cut-off events. [2025-02-06 04:40:08,195 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2025-02-06 04:40:08,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15598 conditions, 7732 events. 5628/7732 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 39086 event pairs, 1634 based on Foata normal form. 1/7594 useless extension candidates. Maximal degree in co-relation 14262. Up to 4718 conditions per place. [2025-02-06 04:40:08,256 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 55 selfloop transitions, 3 changer transitions 1/68 dead transitions. [2025-02-06 04:40:08,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 293 flow [2025-02-06 04:40:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-02-06 04:40:08,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-02-06 04:40:08,266 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 114 flow. Second operand 3 states and 99 transitions. [2025-02-06 04:40:08,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 293 flow [2025-02-06 04:40:08,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 267 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 04:40:08,284 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 117 flow [2025-02-06 04:40:08,285 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-02-06 04:40:08,288 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-02-06 04:40:08,288 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 117 flow [2025-02-06 04:40:08,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:08,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:08,288 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-02-06 04:40:08,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:40:08,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 227300240, now seen corresponding path program 1 times [2025-02-06 04:40:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761352843] [2025-02-06 04:40:08,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:08,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:08,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:40:08,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:40:08,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:08,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761352843] [2025-02-06 04:40:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761352843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399217690] [2025-02-06 04:40:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:08,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:08,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:08,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 04:40:08,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 117 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-02-06 04:40:08,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:08,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 04:40:08,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:09,168 INFO L124 PetriNetUnfolderBase]: 7550/10535 cut-off events. [2025-02-06 04:40:09,168 INFO L125 PetriNetUnfolderBase]: For 1366/1366 co-relation queries the response was YES. [2025-02-06 04:40:09,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22191 conditions, 10535 events. 7550/10535 cut-off events. For 1366/1366 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 58405 event pairs, 2860 based on Foata normal form. 296/10739 useless extension candidates. Maximal degree in co-relation 8939. Up to 6208 conditions per place. [2025-02-06 04:40:09,211 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 63 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-02-06 04:40:09,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 315 flow [2025-02-06 04:40:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-02-06 04:40:09,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-02-06 04:40:09,213 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 117 flow. Second operand 3 states and 102 transitions. [2025-02-06 04:40:09,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 315 flow [2025-02-06 04:40:09,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:09,215 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 128 flow [2025-02-06 04:40:09,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2025-02-06 04:40:09,215 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-02-06 04:40:09,215 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 128 flow [2025-02-06 04:40:09,215 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-02-06 04:40:09,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:09,216 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-02-06 04:40:09,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:40:09,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:09,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:09,216 INFO L85 PathProgramCache]: Analyzing trace with hash -815174038, now seen corresponding path program 1 times [2025-02-06 04:40:09,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:09,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578365197] [2025-02-06 04:40:09,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:09,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:09,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:40:09,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:40:09,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:09,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578365197] [2025-02-06 04:40:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578365197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538766863] [2025-02-06 04:40:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:09,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:09,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:09,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:09,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 04:40:09,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 128 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-02-06 04:40:09,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:09,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 04:40:09,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:10,336 INFO L124 PetriNetUnfolderBase]: 9986/14098 cut-off events. [2025-02-06 04:40:10,337 INFO L125 PetriNetUnfolderBase]: For 3473/3481 co-relation queries the response was YES. [2025-02-06 04:40:10,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30480 conditions, 14098 events. 9986/14098 cut-off events. For 3473/3481 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 81156 event pairs, 3689 based on Foata normal form. 241/14291 useless extension candidates. Maximal degree in co-relation 14973. Up to 8300 conditions per place. [2025-02-06 04:40:10,386 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 63 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-02-06 04:40:10,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 331 flow [2025-02-06 04:40:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-02-06 04:40:10,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 04:40:10,388 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 128 flow. Second operand 3 states and 100 transitions. [2025-02-06 04:40:10,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 331 flow [2025-02-06 04:40:10,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:10,390 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 140 flow [2025-02-06 04:40:10,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2025-02-06 04:40:10,390 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-02-06 04:40:10,390 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 140 flow [2025-02-06 04:40:10,391 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-02-06 04:40:10,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:10,391 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-02-06 04:40:10,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:40:10,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:10,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:10,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1842046977, now seen corresponding path program 1 times [2025-02-06 04:40:10,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:10,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297025577] [2025-02-06 04:40:10,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:10,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:10,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 04:40:10,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:40:10,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:10,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:10,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297025577] [2025-02-06 04:40:10,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297025577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:10,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:40:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030785056] [2025-02-06 04:40:10,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:10,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:40:10,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:10,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:40:10,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:40:10,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 04:40:10,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 140 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-02-06 04:40:10,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:10,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 04:40:10,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:11,304 INFO L124 PetriNetUnfolderBase]: 12499/17802 cut-off events. [2025-02-06 04:40:11,304 INFO L125 PetriNetUnfolderBase]: For 5434/5496 co-relation queries the response was YES. [2025-02-06 04:40:11,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39805 conditions, 17802 events. 12499/17802 cut-off events. For 5434/5496 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 106831 event pairs, 10539 based on Foata normal form. 281/18048 useless extension candidates. Maximal degree in co-relation 20730. Up to 13295 conditions per place. [2025-02-06 04:40:11,462 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 69 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2025-02-06 04:40:11,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 379 flow [2025-02-06 04:40:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:40:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:40:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-02-06 04:40:11,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536 [2025-02-06 04:40:11,464 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 140 flow. Second operand 5 states and 134 transitions. [2025-02-06 04:40:11,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 379 flow [2025-02-06 04:40:11,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:11,466 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 174 flow [2025-02-06 04:40:11,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-02-06 04:40:11,466 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-02-06 04:40:11,466 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 174 flow [2025-02-06 04:40:11,467 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-02-06 04:40:11,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:11,467 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-02-06 04:40:11,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:40:11,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:11,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2138776527, now seen corresponding path program 1 times [2025-02-06 04:40:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:11,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237432281] [2025-02-06 04:40:11,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:11,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 04:40:11,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:40:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237432281] [2025-02-06 04:40:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237432281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:40:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205404839] [2025-02-06 04:40:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:11,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:40:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:11,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:40:11,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:40:11,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 04:40:11,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 174 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-02-06 04:40:11,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:11,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 04:40:11,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:12,819 INFO L124 PetriNetUnfolderBase]: 15695/22574 cut-off events. [2025-02-06 04:40:12,819 INFO L125 PetriNetUnfolderBase]: For 7230/7284 co-relation queries the response was YES. [2025-02-06 04:40:12,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50517 conditions, 22574 events. 15695/22574 cut-off events. For 7230/7284 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 142802 event pairs, 13476 based on Foata normal form. 411/22932 useless extension candidates. Maximal degree in co-relation 40794. Up to 16804 conditions per place. [2025-02-06 04:40:12,955 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 68 selfloop transitions, 5 changer transitions 1/83 dead transitions. [2025-02-06 04:40:12,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 410 flow [2025-02-06 04:40:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:40:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:40:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-02-06 04:40:12,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.585 [2025-02-06 04:40:12,956 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 174 flow. Second operand 4 states and 117 transitions. [2025-02-06 04:40:12,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 410 flow [2025-02-06 04:40:12,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 404 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:12,963 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 192 flow [2025-02-06 04:40:12,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-02-06 04:40:12,964 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-02-06 04:40:12,964 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 192 flow [2025-02-06 04:40:12,964 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-02-06 04:40:12,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:12,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:12,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:40:12,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:12,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1728264978, now seen corresponding path program 1 times [2025-02-06 04:40:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:12,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623647351] [2025-02-06 04:40:12,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:12,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:40:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:40:12,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:12,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623647351] [2025-02-06 04:40:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623647351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:13,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:13,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:40:13,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771679077] [2025-02-06 04:40:13,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:13,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:40:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:13,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:40:13,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:40:13,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 04:40:13,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 192 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:13,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:13,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 04:40:13,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:14,894 INFO L124 PetriNetUnfolderBase]: 20481/29464 cut-off events. [2025-02-06 04:40:14,894 INFO L125 PetriNetUnfolderBase]: For 9417/9417 co-relation queries the response was YES. [2025-02-06 04:40:14,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67245 conditions, 29464 events. 20481/29464 cut-off events. For 9417/9417 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 191592 event pairs, 2021 based on Foata normal form. 666/28768 useless extension candidates. Maximal degree in co-relation 56348. Up to 15619 conditions per place. [2025-02-06 04:40:14,996 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 136 selfloop transitions, 13 changer transitions 3/160 dead transitions. [2025-02-06 04:40:14,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 160 transitions, 778 flow [2025-02-06 04:40:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:40:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:40:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 237 transitions. [2025-02-06 04:40:14,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925 [2025-02-06 04:40:14,998 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 192 flow. Second operand 8 states and 237 transitions. [2025-02-06 04:40:14,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 160 transitions, 778 flow [2025-02-06 04:40:15,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 160 transitions, 768 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:15,003 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 285 flow [2025-02-06 04:40:15,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=285, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-02-06 04:40:15,004 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-02-06 04:40:15,004 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 285 flow [2025-02-06 04:40:15,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:15,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:15,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:15,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:40:15,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:15,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:15,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1746085712, now seen corresponding path program 1 times [2025-02-06 04:40:15,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:15,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15421429] [2025-02-06 04:40:15,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:15,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:40:15,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:40:15,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:15,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:40:15,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:15,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15421429] [2025-02-06 04:40:15,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15421429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:15,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:15,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:40:15,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700952190] [2025-02-06 04:40:15,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:15,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:40:15,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:15,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:40:15,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:40:15,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 04:40:15,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:15,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:15,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 04:40:15,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:17,203 INFO L124 PetriNetUnfolderBase]: 23322/33629 cut-off events. [2025-02-06 04:40:17,204 INFO L125 PetriNetUnfolderBase]: For 33091/33358 co-relation queries the response was YES. [2025-02-06 04:40:17,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89980 conditions, 33629 events. 23322/33629 cut-off events. For 33091/33358 co-relation queries the response was YES. Maximal size of possible extension queue 1159. Compared 224404 event pairs, 6508 based on Foata normal form. 334/32204 useless extension candidates. Maximal degree in co-relation 73913. Up to 26933 conditions per place. [2025-02-06 04:40:17,375 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 90 selfloop transitions, 28 changer transitions 10/137 dead transitions. [2025-02-06 04:40:17,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 137 transitions, 848 flow [2025-02-06 04:40:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:40:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:40:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2025-02-06 04:40:17,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-02-06 04:40:17,376 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 285 flow. Second operand 6 states and 170 transitions. [2025-02-06 04:40:17,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 137 transitions, 848 flow [2025-02-06 04:40:17,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 137 transitions, 846 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 04:40:17,397 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 516 flow [2025-02-06 04:40:17,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=516, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2025-02-06 04:40:17,398 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2025-02-06 04:40:17,398 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 516 flow [2025-02-06 04:40:17,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:17,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:17,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:17,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:40:17,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:17,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1102772018, now seen corresponding path program 2 times [2025-02-06 04:40:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237604750] [2025-02-06 04:40:17,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:40:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:17,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:40:17,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 37 statements. [2025-02-06 04:40:17,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:40:17,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:40:17,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237604750] [2025-02-06 04:40:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237604750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:17,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:17,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:40:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825481007] [2025-02-06 04:40:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:17,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:40:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:17,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:40:17,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:40:17,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 04:40:17,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:17,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:17,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 04:40:17,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:20,421 INFO L124 PetriNetUnfolderBase]: 25457/37056 cut-off events. [2025-02-06 04:40:20,421 INFO L125 PetriNetUnfolderBase]: For 41909/41909 co-relation queries the response was YES. [2025-02-06 04:40:20,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110742 conditions, 37056 events. 25457/37056 cut-off events. For 41909/41909 co-relation queries the response was YES. Maximal size of possible extension queue 1224. Compared 251312 event pairs, 6689 based on Foata normal form. 102/37138 useless extension candidates. Maximal degree in co-relation 91039. Up to 28382 conditions per place. [2025-02-06 04:40:20,619 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 100 selfloop transitions, 41 changer transitions 6/156 dead transitions. [2025-02-06 04:40:20,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 1126 flow [2025-02-06 04:40:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:40:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:40:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-02-06 04:40:20,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-06 04:40:20,621 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 516 flow. Second operand 6 states and 175 transitions. [2025-02-06 04:40:20,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 1126 flow [2025-02-06 04:40:20,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 156 transitions, 1089 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:20,749 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 742 flow [2025-02-06 04:40:20,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2025-02-06 04:40:20,750 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2025-02-06 04:40:20,750 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 742 flow [2025-02-06 04:40:20,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:20,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:20,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:20,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:40:20,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:20,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash -202449140, now seen corresponding path program 3 times [2025-02-06 04:40:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:20,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617688327] [2025-02-06 04:40:20,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:40:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:20,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:40:20,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 37 statements. [2025-02-06 04:40:20,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:40:20,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:40:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617688327] [2025-02-06 04:40:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617688327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:40:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060405099] [2025-02-06 04:40:20,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:40:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:20,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:40:20,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:40:20,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 04:40:20,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 742 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:20,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:20,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 04:40:20,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:23,732 INFO L124 PetriNetUnfolderBase]: 25802/37748 cut-off events. [2025-02-06 04:40:23,732 INFO L125 PetriNetUnfolderBase]: For 58118/58140 co-relation queries the response was YES. [2025-02-06 04:40:23,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117588 conditions, 37748 events. 25802/37748 cut-off events. For 58118/58140 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 259728 event pairs, 6570 based on Foata normal form. 106/37833 useless extension candidates. Maximal degree in co-relation 95936. Up to 28382 conditions per place. [2025-02-06 04:40:23,993 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 89 selfloop transitions, 51 changer transitions 24/173 dead transitions. [2025-02-06 04:40:23,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 173 transitions, 1445 flow [2025-02-06 04:40:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:40:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:40:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-02-06 04:40:23,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-02-06 04:40:23,998 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 742 flow. Second operand 6 states and 174 transitions. [2025-02-06 04:40:23,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 173 transitions, 1445 flow [2025-02-06 04:40:24,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 173 transitions, 1386 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:40:24,132 INFO L231 Difference]: Finished difference. Result has 95 places, 112 transitions, 980 flow [2025-02-06 04:40:24,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=95, PETRI_TRANSITIONS=112} [2025-02-06 04:40:24,135 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2025-02-06 04:40:24,135 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 112 transitions, 980 flow [2025-02-06 04:40:24,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:24,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:24,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:24,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:40:24,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:24,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash 385342478, now seen corresponding path program 4 times [2025-02-06 04:40:24,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:24,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366586050] [2025-02-06 04:40:24,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:40:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:24,148 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:40:24,169 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:40:24,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:40:24,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:40:24,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:24,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366586050] [2025-02-06 04:40:24,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366586050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:24,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:24,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:40:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868993471] [2025-02-06 04:40:24,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:24,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:40:24,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:24,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:40:24,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:40:24,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 04:40:24,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 112 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:24,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:24,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 04:40:24,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:28,450 INFO L124 PetriNetUnfolderBase]: 36043/52870 cut-off events. [2025-02-06 04:40:28,450 INFO L125 PetriNetUnfolderBase]: For 112696/112704 co-relation queries the response was YES. [2025-02-06 04:40:28,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172427 conditions, 52870 events. 36043/52870 cut-off events. For 112696/112704 co-relation queries the response was YES. Maximal size of possible extension queue 1798. Compared 382913 event pairs, 5276 based on Foata normal form. 366/53182 useless extension candidates. Maximal degree in co-relation 138479. Up to 17954 conditions per place. [2025-02-06 04:40:28,892 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 225 selfloop transitions, 141 changer transitions 2/377 dead transitions. [2025-02-06 04:40:28,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 377 transitions, 3776 flow [2025-02-06 04:40:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:40:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:40:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 303 transitions. [2025-02-06 04:40:28,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.606 [2025-02-06 04:40:28,893 INFO L175 Difference]: Start difference. First operand has 95 places, 112 transitions, 980 flow. Second operand 10 states and 303 transitions. [2025-02-06 04:40:28,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 377 transitions, 3776 flow [2025-02-06 04:40:29,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 377 transitions, 3567 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-02-06 04:40:29,214 INFO L231 Difference]: Finished difference. Result has 107 places, 222 transitions, 2724 flow [2025-02-06 04:40:29,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2724, PETRI_PLACES=107, PETRI_TRANSITIONS=222} [2025-02-06 04:40:29,215 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 55 predicate places. [2025-02-06 04:40:29,215 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 222 transitions, 2724 flow [2025-02-06 04:40:29,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:29,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:29,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:29,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:40:29,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:29,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash -204055966, now seen corresponding path program 5 times [2025-02-06 04:40:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256769190] [2025-02-06 04:40:29,219 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:40:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:29,232 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:40:29,244 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:40:29,245 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:40:29,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256769190] [2025-02-06 04:40:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256769190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:29,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:29,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:40:29,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451251815] [2025-02-06 04:40:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:29,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:40:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:29,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:40:29,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:40:29,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 04:40:29,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 222 transitions, 2724 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:29,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:29,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 04:40:29,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:36,481 INFO L124 PetriNetUnfolderBase]: 54841/78943 cut-off events. [2025-02-06 04:40:36,482 INFO L125 PetriNetUnfolderBase]: For 254749/256203 co-relation queries the response was YES. [2025-02-06 04:40:36,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291105 conditions, 78943 events. 54841/78943 cut-off events. For 254749/256203 co-relation queries the response was YES. Maximal size of possible extension queue 3008. Compared 578489 event pairs, 12018 based on Foata normal form. 1282/79669 useless extension candidates. Maximal degree in co-relation 243434. Up to 45007 conditions per place. [2025-02-06 04:40:37,152 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 205 selfloop transitions, 182 changer transitions 25/423 dead transitions. [2025-02-06 04:40:37,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 423 transitions, 4924 flow [2025-02-06 04:40:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:40:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:40:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 293 transitions. [2025-02-06 04:40:37,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.586 [2025-02-06 04:40:37,154 INFO L175 Difference]: Start difference. First operand has 107 places, 222 transitions, 2724 flow. Second operand 10 states and 293 transitions. [2025-02-06 04:40:37,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 423 transitions, 4924 flow [2025-02-06 04:40:39,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 423 transitions, 4916 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-02-06 04:40:39,561 INFO L231 Difference]: Finished difference. Result has 122 places, 268 transitions, 3819 flow [2025-02-06 04:40:39,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3819, PETRI_PLACES=122, PETRI_TRANSITIONS=268} [2025-02-06 04:40:39,562 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 70 predicate places. [2025-02-06 04:40:39,562 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 268 transitions, 3819 flow [2025-02-06 04:40:39,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:39,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:39,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:39,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:40:39,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:40:39,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1495056434, now seen corresponding path program 6 times [2025-02-06 04:40:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:39,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187800114] [2025-02-06 04:40:39,563 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:40:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:39,570 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:40:39,576 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 33 of 37 statements. [2025-02-06 04:40:39,576 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:40:39,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:40:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187800114] [2025-02-06 04:40:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187800114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:40:39,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763241579] [2025-02-06 04:40:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:39,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:40:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:39,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:40:39,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:40:39,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-06 04:40:39,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 268 transitions, 3819 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:40:39,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:39,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-06 04:40:39,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand