./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-bad-commit-1.wvr-bad.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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:42:46,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:42:46,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:42:46,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:42:46,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:42:46,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:42:46,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:42:46,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:42:46,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:42:46,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:42:46,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:42:46,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:42:46,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:42:46,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:42:46,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:42:46,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:42:46,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:42:46,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:42:46,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:42:46,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:42:46,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:46,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:46,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:46,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:46,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:42:46,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:46,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:46,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:46,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:46,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:42:46,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:42:46,956 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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-01-09 16:42:47,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:42:47,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:42:47,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:42:47,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:42:47,190 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:42:47,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-01-09 16:42:48,314 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02a8e1799/5799b387cca143aea5a980e5cf3dd9f0/FLAG544962965 [2025-01-09 16:42:48,560 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:42:48,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-01-09 16:42:48,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02a8e1799/5799b387cca143aea5a980e5cf3dd9f0/FLAG544962965 [2025-01-09 16:42:48,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02a8e1799/5799b387cca143aea5a980e5cf3dd9f0 [2025-01-09 16:42:48,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:42:48,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:42:48,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:48,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:42:48,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:42:48,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:48" (1/1) ... [2025-01-09 16:42:48,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b49f2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:48, skipping insertion in model container [2025-01-09 16:42:48,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:48" (1/1) ... [2025-01-09 16:42:48,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:42:49,036 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-bad-commit-1.wvr-bad.c[5161,5174] [2025-01-09 16:42:49,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:49,050 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:42:49,076 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-bad-commit-1.wvr-bad.c[5161,5174] [2025-01-09 16:42:49,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:49,091 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:42:49,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49 WrapperNode [2025-01-09 16:42:49,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:49,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:49,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:42:49,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:42:49,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,132 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-01-09 16:42:49,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:49,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:42:49,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:42:49,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:42:49,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,165 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:42:49,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,178 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:42:49,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:42:49,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:42:49,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:42:49,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (1/1) ... [2025-01-09 16:42:49,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:49,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:49,215 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-01-09 16:42:49,219 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-01-09 16:42:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:42:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:42:49,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:42:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:42:49,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:42:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:42:49,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:42:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:42:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:42:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:42:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:42:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:42:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:42:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:42:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:42:49,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:42:49,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:42:49,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:42:49,242 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:42:49,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:42:49,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:42:49,732 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:42:49,732 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:42:50,036 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:42:50,037 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 16:42:50,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:50 BoogieIcfgContainer [2025-01-09 16:42:50,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:42:50,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:42:50,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:42:50,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:42:50,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:48" (1/3) ... [2025-01-09 16:42:50,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519b831a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:50, skipping insertion in model container [2025-01-09 16:42:50,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:49" (2/3) ... [2025-01-09 16:42:50,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519b831a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:50, skipping insertion in model container [2025-01-09 16:42:50,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:50" (3/3) ... [2025-01-09 16:42:50,044 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-01-09 16:42:50,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:42:50,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:42:50,056 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:42:50,093 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:42:50,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 61 transitions, 143 flow [2025-01-09 16:42:50,156 INFO L124 PetriNetUnfolderBase]: 17/58 cut-off events. [2025-01-09 16:42:50,158 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:42:50,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 17/58 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 120 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2025-01-09 16:42:50,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 61 transitions, 143 flow [2025-01-09 16:42:50,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 57 transitions, 132 flow [2025-01-09 16:42:50,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:42:50,189 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;@15c05391, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:42:50,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:42:50,207 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:42:50,207 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2025-01-09 16:42:50,207 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:42:50,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:50,208 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] [2025-01-09 16:42:50,208 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 1 more)] === [2025-01-09 16:42:50,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1387195502, now seen corresponding path program 1 times [2025-01-09 16:42:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:50,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205567697] [2025-01-09 16:42:50,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:50,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:42:50,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:42:50,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:50,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205567697] [2025-01-09 16:42:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205567697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:50,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:42:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243693256] [2025-01-09 16:42:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:50,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:42:50,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:50,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:42:50,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:42:50,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-09 16:42:50,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-01-09 16:42:50,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:50,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-09 16:42:50,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:50,640 INFO L124 PetriNetUnfolderBase]: 1163/1704 cut-off events. [2025-01-09 16:42:50,640 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-01-09 16:42:50,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1704 events. 1163/1704 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6726 event pairs, 608 based on Foata normal form. 0/1341 useless extension candidates. Maximal degree in co-relation 2998. Up to 1448 conditions per place. [2025-01-09 16:42:50,652 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 37 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2025-01-09 16:42:50,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 200 flow [2025-01-09 16:42:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:42:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:42:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-01-09 16:42:50,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2025-01-09 16:42:50,661 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 132 flow. Second operand 2 states and 80 transitions. [2025-01-09 16:42:50,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 200 flow [2025-01-09 16:42:50,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 188 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:42:50,666 INFO L231 Difference]: Finished difference. Result has 45 places, 54 transitions, 114 flow [2025-01-09 16:42:50,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=54} [2025-01-09 16:42:50,669 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-01-09 16:42:50,669 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 54 transitions, 114 flow [2025-01-09 16:42:50,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-01-09 16:42:50,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:50,670 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] [2025-01-09 16:42:50,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:42:50,670 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 1 more)] === [2025-01-09 16:42:50,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1777682512, now seen corresponding path program 1 times [2025-01-09 16:42:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897247413] [2025-01-09 16:42:50,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:50,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:42:50,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:42:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:50,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897247413] [2025-01-09 16:42:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897247413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:50,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:50,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:42:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041862345] [2025-01-09 16:42:50,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:50,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:50,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:50,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:50,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-09 16:42:50,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 54 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:50,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:50,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-09 16:42:50,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:51,141 INFO L124 PetriNetUnfolderBase]: 2322/3638 cut-off events. [2025-01-09 16:42:51,142 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 16:42:51,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6587 conditions, 3638 events. 2322/3638 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18726 event pairs, 608 based on Foata normal form. 1/2845 useless extension candidates. Maximal degree in co-relation 6584. Up to 1685 conditions per place. [2025-01-09 16:42:51,160 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 59 selfloop transitions, 5 changer transitions 1/82 dead transitions. [2025-01-09 16:42:51,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 305 flow [2025-01-09 16:42:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-09 16:42:51,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-01-09 16:42:51,162 INFO L175 Difference]: Start difference. First operand has 45 places, 54 transitions, 114 flow. Second operand 3 states and 126 transitions. [2025-01-09 16:42:51,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 305 flow [2025-01-09 16:42:51,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 305 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:42:51,165 INFO L231 Difference]: Finished difference. Result has 48 places, 58 transitions, 147 flow [2025-01-09 16:42:51,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=48, PETRI_TRANSITIONS=58} [2025-01-09 16:42:51,165 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-01-09 16:42:51,165 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 58 transitions, 147 flow [2025-01-09 16:42:51,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:51,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:51,166 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:51,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:42:51,166 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 1 more)] === [2025-01-09 16:42:51,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash -378389970, now seen corresponding path program 1 times [2025-01-09 16:42:51,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:51,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808848135] [2025-01-09 16:42:51,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:51,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:51,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:42:51,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:42:51,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:51,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808848135] [2025-01-09 16:42:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808848135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:42:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518704943] [2025-01-09 16:42:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:51,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:51,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-09 16:42:51,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 58 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-01-09 16:42:51,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:51,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-09 16:42:51,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:51,819 INFO L124 PetriNetUnfolderBase]: 4366/6626 cut-off events. [2025-01-09 16:42:51,819 INFO L125 PetriNetUnfolderBase]: For 1033/1033 co-relation queries the response was YES. [2025-01-09 16:42:51,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13266 conditions, 6626 events. 4366/6626 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 35776 event pairs, 1536 based on Foata normal form. 236/5382 useless extension candidates. Maximal degree in co-relation 13261. Up to 3068 conditions per place. [2025-01-09 16:42:51,852 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 65 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-01-09 16:42:51,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 353 flow [2025-01-09 16:42:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-01-09 16:42:51,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6775956284153005 [2025-01-09 16:42:51,854 INFO L175 Difference]: Start difference. First operand has 48 places, 58 transitions, 147 flow. Second operand 3 states and 124 transitions. [2025-01-09 16:42:51,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 353 flow [2025-01-09 16:42:51,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:51,856 INFO L231 Difference]: Finished difference. Result has 50 places, 60 transitions, 167 flow [2025-01-09 16:42:51,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=60} [2025-01-09 16:42:51,856 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-01-09 16:42:51,856 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 60 transitions, 167 flow [2025-01-09 16:42:51,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-01-09 16:42:51,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:51,857 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:42:51,857 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 1 more)] === [2025-01-09 16:42:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash -21173204, now seen corresponding path program 1 times [2025-01-09 16:42:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991550237] [2025-01-09 16:42:51,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:51,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:42:51,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:42:51,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:51,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991550237] [2025-01-09 16:42:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991550237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407406093] [2025-01-09 16:42:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:51,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:51,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:51,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-09 16:42:51,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 60 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-01-09 16:42:51,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:51,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-09 16:42:51,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:52,581 INFO L124 PetriNetUnfolderBase]: 8300/13328 cut-off events. [2025-01-09 16:42:52,581 INFO L125 PetriNetUnfolderBase]: For 3336/3360 co-relation queries the response was YES. [2025-01-09 16:42:52,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27078 conditions, 13328 events. 8300/13328 cut-off events. For 3336/3360 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 88054 event pairs, 2722 based on Foata normal form. 245/10625 useless extension candidates. Maximal degree in co-relation 27072. Up to 5665 conditions per place. [2025-01-09 16:42:52,635 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 74 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-01-09 16:42:52,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 422 flow [2025-01-09 16:42:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-09 16:42:52,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-01-09 16:42:52,636 INFO L175 Difference]: Start difference. First operand has 50 places, 60 transitions, 167 flow. Second operand 3 states and 126 transitions. [2025-01-09 16:42:52,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 422 flow [2025-01-09 16:42:52,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:52,639 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 178 flow [2025-01-09 16:42:52,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2025-01-09 16:42:52,640 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-01-09 16:42:52,640 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 61 transitions, 178 flow [2025-01-09 16:42:52,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-01-09 16:42:52,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:52,640 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:52,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:42:52,640 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 1 more)] === [2025-01-09 16:42:52,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1040058746, now seen corresponding path program 1 times [2025-01-09 16:42:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:52,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823296142] [2025-01-09 16:42:52,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:52,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:42:52,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:42:52,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:52,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823296142] [2025-01-09 16:42:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823296142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:42:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188805325] [2025-01-09 16:42:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:52,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:52,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:52,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:52,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2025-01-09 16:42:52,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 61 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-01-09 16:42:52,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:52,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2025-01-09 16:42:52,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:53,689 INFO L124 PetriNetUnfolderBase]: 13306/19339 cut-off events. [2025-01-09 16:42:53,690 INFO L125 PetriNetUnfolderBase]: For 6492/6506 co-relation queries the response was YES. [2025-01-09 16:42:53,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42408 conditions, 19339 events. 13306/19339 cut-off events. For 6492/6506 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 113206 event pairs, 6178 based on Foata normal form. 0/15600 useless extension candidates. Maximal degree in co-relation 42401. Up to 10586 conditions per place. [2025-01-09 16:42:53,763 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 69 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-01-09 16:42:53,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 420 flow [2025-01-09 16:42:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-01-09 16:42:53,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2025-01-09 16:42:53,765 INFO L175 Difference]: Start difference. First operand has 52 places, 61 transitions, 178 flow. Second operand 3 states and 116 transitions. [2025-01-09 16:42:53,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 420 flow [2025-01-09 16:42:53,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:53,767 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 206 flow [2025-01-09 16:42:53,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2025-01-09 16:42:53,768 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-01-09 16:42:53,768 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 206 flow [2025-01-09 16:42:53,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-01-09 16:42:53,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:53,768 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:53,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:42:53,769 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 1 more)] === [2025-01-09 16:42:53,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash 237158054, now seen corresponding path program 1 times [2025-01-09 16:42:53,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:53,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401675460] [2025-01-09 16:42:53,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:53,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:42:53,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:42:53,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:53,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:53,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401675460] [2025-01-09 16:42:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401675460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:53,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364595068] [2025-01-09 16:42:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:53,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:42:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:53,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:42:53,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:42:53,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-09 16:42:53,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-01-09 16:42:53,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:53,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-09 16:42:53,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:54,720 INFO L124 PetriNetUnfolderBase]: 12900/19830 cut-off events. [2025-01-09 16:42:54,721 INFO L125 PetriNetUnfolderBase]: For 9506/9688 co-relation queries the response was YES. [2025-01-09 16:42:54,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43792 conditions, 19830 events. 12900/19830 cut-off events. For 9506/9688 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 128321 event pairs, 9082 based on Foata normal form. 318/16318 useless extension candidates. Maximal degree in co-relation 43784. Up to 13549 conditions per place. [2025-01-09 16:42:54,799 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 74 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-01-09 16:42:54,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 446 flow [2025-01-09 16:42:54,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:42:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:42:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-01-09 16:42:54,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2025-01-09 16:42:54,801 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 206 flow. Second operand 4 states and 150 transitions. [2025-01-09 16:42:54,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 446 flow [2025-01-09 16:42:54,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:54,813 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 216 flow [2025-01-09 16:42:54,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2025-01-09 16:42:54,814 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2025-01-09 16:42:54,814 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 216 flow [2025-01-09 16:42:54,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-01-09 16:42:54,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:54,814 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:54,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:42:54,814 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 1 more)] === [2025-01-09 16:42:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1813044521, now seen corresponding path program 1 times [2025-01-09 16:42:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:54,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504026129] [2025-01-09 16:42:54,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:54,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:42:54,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:42:54,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:54,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:55,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504026129] [2025-01-09 16:42:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504026129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401070421] [2025-01-09 16:42:55,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:55,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:55,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:55,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:55,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:42:55,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:42:55,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:42:55,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:55,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:55,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 16:42:55,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:55,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:42:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:56,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:56,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-09 16:42:56,816 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:42:56,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-01-09 16:42:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401070421] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:56,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-01-09 16:42:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10137524] [2025-01-09 16:42:56,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:56,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 16:42:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:56,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 16:42:56,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:42:56,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-09 16:42:56,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 216 flow. Second operand has 22 states, 22 states have (on average 24.09090909090909) internal successors, (530), 22 states have internal predecessors, (530), 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-01-09 16:42:56,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:56,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-09 16:42:56,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:05,051 INFO L124 PetriNetUnfolderBase]: 78785/121351 cut-off events. [2025-01-09 16:43:05,051 INFO L125 PetriNetUnfolderBase]: For 55124/57647 co-relation queries the response was YES. [2025-01-09 16:43:05,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266597 conditions, 121351 events. 78785/121351 cut-off events. For 55124/57647 co-relation queries the response was YES. Maximal size of possible extension queue 3054. Compared 968479 event pairs, 9798 based on Foata normal form. 168/96265 useless extension candidates. Maximal degree in co-relation 266587. Up to 17378 conditions per place. [2025-01-09 16:43:05,702 INFO L140 encePairwiseOnDemand]: 41/61 looper letters, 753 selfloop transitions, 197 changer transitions 17/985 dead transitions. [2025-01-09 16:43:05,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 985 transitions, 4810 flow [2025-01-09 16:43:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-09 16:43:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-01-09 16:43:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 1988 transitions. [2025-01-09 16:43:05,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6149087534797402 [2025-01-09 16:43:05,708 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 216 flow. Second operand 53 states and 1988 transitions. [2025-01-09 16:43:05,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 985 transitions, 4810 flow [2025-01-09 16:43:05,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 985 transitions, 4806 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:05,745 INFO L231 Difference]: Finished difference. Result has 149 places, 265 transitions, 1969 flow [2025-01-09 16:43:05,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=1969, PETRI_PLACES=149, PETRI_TRANSITIONS=265} [2025-01-09 16:43:05,746 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 99 predicate places. [2025-01-09 16:43:05,746 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 265 transitions, 1969 flow [2025-01-09 16:43:05,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 24.09090909090909) internal successors, (530), 22 states have internal predecessors, (530), 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-01-09 16:43:05,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:05,747 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:05,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:43:05,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:05,951 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 1 more)] === [2025-01-09 16:43:05,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1124080404, now seen corresponding path program 1 times [2025-01-09 16:43:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286704014] [2025-01-09 16:43:05,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:05,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:43:05,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:43:05,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:05,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:05,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286704014] [2025-01-09 16:43:05,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286704014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:05,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:05,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:43:05,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999812351] [2025-01-09 16:43:05,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:05,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:05,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:05,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:05,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:06,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2025-01-09 16:43:06,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 265 transitions, 1969 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-01-09 16:43:06,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:06,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2025-01-09 16:43:06,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:24,942 INFO L124 PetriNetUnfolderBase]: 127995/184743 cut-off events. [2025-01-09 16:43:24,942 INFO L125 PetriNetUnfolderBase]: For 2984100/2990569 co-relation queries the response was YES. [2025-01-09 16:43:26,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139387 conditions, 184743 events. 127995/184743 cut-off events. For 2984100/2990569 co-relation queries the response was YES. Maximal size of possible extension queue 3965. Compared 1362105 event pairs, 44744 based on Foata normal form. 184/154178 useless extension candidates. Maximal degree in co-relation 1139337. Up to 90999 conditions per place. [2025-01-09 16:43:27,245 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 176 selfloop transitions, 21 changer transitions 35/245 dead transitions. [2025-01-09 16:43:27,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 245 transitions, 2407 flow [2025-01-09 16:43:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:43:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:43:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-01-09 16:43:27,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6120218579234973 [2025-01-09 16:43:27,247 INFO L175 Difference]: Start difference. First operand has 149 places, 265 transitions, 1969 flow. Second operand 3 states and 112 transitions. [2025-01-09 16:43:27,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 245 transitions, 2407 flow [2025-01-09 16:43:35,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 245 transitions, 2117 flow, removed 143 selfloop flow, removed 15 redundant places. [2025-01-09 16:43:35,568 INFO L231 Difference]: Finished difference. Result has 123 places, 163 transitions, 1160 flow [2025-01-09 16:43:35,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1160, PETRI_PLACES=123, PETRI_TRANSITIONS=163} [2025-01-09 16:43:35,569 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 73 predicate places. [2025-01-09 16:43:35,569 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 163 transitions, 1160 flow [2025-01-09 16:43:35,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-01-09 16:43:35,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:35,569 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:35,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:43:35,569 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 1 more)] === [2025-01-09 16:43:35,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash -459145072, now seen corresponding path program 1 times [2025-01-09 16:43:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:35,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584081867] [2025-01-09 16:43:35,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:35,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:43:35,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:43:35,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:35,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:43:35,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:35,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584081867] [2025-01-09 16:43:35,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584081867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:35,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:43:35,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552439742] [2025-01-09 16:43:35,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:35,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:43:35,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:35,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:43:35,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:43:35,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2025-01-09 16:43:35,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 163 transitions, 1160 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:35,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:35,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2025-01-09 16:43:35,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand