./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83223bd52506e4247e7ac7ce7a49284be0292b773b9e827e6221f58042ba0602 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:34:09,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:34:09,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:34:09,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:34:09,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:34:09,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:34:09,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:34:09,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:34:09,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:34:09,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:34:09,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:34:09,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:34:09,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:34:09,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:34:09,329 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:34:09,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:34:09,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:34:09,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:34:09,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:34:09,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:34:09,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:34:09,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:34:09,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:34:09,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:34:09,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:34:09,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:34:09,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:34:09,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:34:09,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:34:09,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:34:09,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:34:09,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:34:09,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:34:09,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:34:09,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:34:09,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:34:09,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:34:09,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:34:09,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:34:09,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:34:09,337 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:34:09,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:34:09,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:34:09,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83223bd52506e4247e7ac7ce7a49284be0292b773b9e827e6221f58042ba0602 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:34:09,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:34:09,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:34:09,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:34:09,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:34:09,580 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:34:09,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c [2024-02-19 14:34:10,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:34:10,839 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:34:10,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c [2024-02-19 14:34:10,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2061bd29b/ede75d27842341feb63fe20cd7d4c951/FLAGf7847ea99 [2024-02-19 14:34:10,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2061bd29b/ede75d27842341feb63fe20cd7d4c951 [2024-02-19 14:34:10,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:34:10,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:34:10,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:34:10,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:34:10,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:34:10,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:34:10" (1/1) ... [2024-02-19 14:34:10,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34693c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:10, skipping insertion in model container [2024-02-19 14:34:10,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:34:10" (1/1) ... [2024-02-19 14:34:10,900 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:34:11,089 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c[4836,4849] [2024-02-19 14:34:11,101 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:34:11,111 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:34:11,156 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-subst.wvr.c[4836,4849] [2024-02-19 14:34:11,172 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:34:11,185 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:34:11,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11 WrapperNode [2024-02-19 14:34:11,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:34:11,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:34:11,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:34:11,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:34:11,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,251 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 316 [2024-02-19 14:34:11,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:34:11,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:34:11,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:34:11,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:34:11,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,302 INFO L175 MemorySlicer]: Split 12 memory accesses to 5 slices as follows [2, 2, 2, 4, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-19 14:34:11,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:34:11,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:34:11,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:34:11,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:34:11,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (1/1) ... [2024-02-19 14:34:11,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:34:11,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:11,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 14:34:11,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 14:34:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:34:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:34:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:34:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:34:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:34:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:34:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:34:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:34:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:34:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:34:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:34:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:34:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:34:11,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:34:11,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:34:11,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:34:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:34:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:34:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:34:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 14:34:11,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:34:11,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:34:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:34:11,415 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:34:11,548 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:34:11,549 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:34:11,945 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:34:11,945 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:34:12,268 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:34:12,268 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 14:34:12,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:34:12 BoogieIcfgContainer [2024-02-19 14:34:12,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:34:12,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:34:12,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:34:12,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:34:12,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:34:10" (1/3) ... [2024-02-19 14:34:12,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffdf5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:34:12, skipping insertion in model container [2024-02-19 14:34:12,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:34:11" (2/3) ... [2024-02-19 14:34:12,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffdf5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:34:12, skipping insertion in model container [2024-02-19 14:34:12,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:34:12" (3/3) ... [2024-02-19 14:34:12,276 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2024-02-19 14:34:12,291 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:34:12,292 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:34:12,292 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:34:12,340 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 14:34:12,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 97 flow [2024-02-19 14:34:12,399 INFO L124 PetriNetUnfolderBase]: 7/35 cut-off events. [2024-02-19 14:34:12,400 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 14:34:12,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 7/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-02-19 14:34:12,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 38 transitions, 97 flow [2024-02-19 14:34:12,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 34 transitions, 86 flow [2024-02-19 14:34:12,416 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:34:12,420 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@519e624d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:34:12,421 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 14:34:12,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:34:12,429 INFO L124 PetriNetUnfolderBase]: 7/33 cut-off events. [2024-02-19 14:34:12,430 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 14:34:12,430 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:12,430 INFO L234 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] [2024-02-19 14:34:12,430 INFO L432 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)] === [2024-02-19 14:34:12,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1134882823, now seen corresponding path program 1 times [2024-02-19 14:34:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:12,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758555902] [2024-02-19 14:34:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:34:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758555902] [2024-02-19 14:34:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758555902] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:34:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976252010] [2024-02-19 14:34:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:12,675 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-19 14:34:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:12,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-19 14:34:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-19 14:34:12,743 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:12,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2024-02-19 14:34:12,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:12,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:12,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:12,999 INFO L124 PetriNetUnfolderBase]: 466/696 cut-off events. [2024-02-19 14:34:12,999 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-02-19 14:34:13,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 696 events. 466/696 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2418 event pairs, 333 based on Foata normal form. 132/675 useless extension candidates. Maximal degree in co-relation 1177. Up to 679 conditions per place. [2024-02-19 14:34:13,012 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2024-02-19 14:34:13,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 134 flow [2024-02-19 14:34:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-19 14:34:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-19 14:34:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2024-02-19 14:34:13,026 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2024-02-19 14:34:13,030 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-02-19 14:34:13,031 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 134 flow [2024-02-19 14:34:13,031 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2024-02-19 14:34:13,032 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:13,032 INFO L234 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] [2024-02-19 14:34:13,032 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:34:13,032 INFO L432 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)] === [2024-02-19 14:34:13,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1038142041, now seen corresponding path program 1 times [2024-02-19 14:34:13,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:13,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224990571] [2024-02-19 14:34:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:13,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:34:13,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224990571] [2024-02-19 14:34:13,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224990571] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:34:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377123519] [2024-02-19 14:34:13,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:13,269 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:34:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:13,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:34:13,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:34:13,271 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:13,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2024-02-19 14:34:13,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:13,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:13,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:13,408 INFO L124 PetriNetUnfolderBase]: 466/696 cut-off events. [2024-02-19 14:34:13,409 INFO L125 PetriNetUnfolderBase]: For 80/132 co-relation queries the response was YES. [2024-02-19 14:34:13,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 696 events. 466/696 cut-off events. For 80/132 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2441 event pairs, 333 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 1736. Up to 680 conditions per place. [2024-02-19 14:34:13,413 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 26 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2024-02-19 14:34:13,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 194 flow [2024-02-19 14:34:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:34:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:34:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2024-02-19 14:34:13,415 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2024-02-19 14:34:13,417 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2024-02-19 14:34:13,417 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 194 flow [2024-02-19 14:34:13,417 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2024-02-19 14:34:13,417 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:13,418 INFO L234 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] [2024-02-19 14:34:13,418 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:34:13,418 INFO L432 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)] === [2024-02-19 14:34:13,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1791199939, now seen corresponding path program 1 times [2024-02-19 14:34:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:13,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789118963] [2024-02-19 14:34:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:34:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:13,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789118963] [2024-02-19 14:34:13,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789118963] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:34:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108106970] [2024-02-19 14:34:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:13,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:13,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:34:13,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:34:13,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 14:34:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:13,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 14:34:13,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:34:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:34:13,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:34:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:34:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108106970] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:34:13,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:34:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-02-19 14:34:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678019963] [2024-02-19 14:34:13,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:34:13,727 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:13,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:13,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:13,728 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:13,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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) [2024-02-19 14:34:13,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:13,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:13,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:13,863 INFO L124 PetriNetUnfolderBase]: 466/701 cut-off events. [2024-02-19 14:34:13,863 INFO L125 PetriNetUnfolderBase]: For 160/236 co-relation queries the response was YES. [2024-02-19 14:34:13,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 701 events. 466/701 cut-off events. For 160/236 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2448 event pairs, 333 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 2299. Up to 682 conditions per place. [2024-02-19 14:34:13,868 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 26 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2024-02-19 14:34:13,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 266 flow [2024-02-19 14:34:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:34:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:34:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2024-02-19 14:34:13,871 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3526315789473684 [2024-02-19 14:34:13,872 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2024-02-19 14:34:13,872 INFO L507 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 266 flow [2024-02-19 14:34:13,872 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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) [2024-02-19 14:34:13,872 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:13,873 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:13,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 14:34:14,087 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:34:14,087 INFO L432 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)] === [2024-02-19 14:34:14,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1966668039, now seen corresponding path program 2 times [2024-02-19 14:34:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225652243] [2024-02-19 14:34:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:14,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225652243] [2024-02-19 14:34:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225652243] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:14,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:34:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917363918] [2024-02-19 14:34:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:14,774 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:34:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:34:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:34:14,776 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:14,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 266 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:34:14,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:14,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:14,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:15,335 INFO L124 PetriNetUnfolderBase]: 1270/1992 cut-off events. [2024-02-19 14:34:15,335 INFO L125 PetriNetUnfolderBase]: For 911/1055 co-relation queries the response was YES. [2024-02-19 14:34:15,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9756 conditions, 1992 events. 1270/1992 cut-off events. For 911/1055 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9840 event pairs, 361 based on Foata normal form. 1/1578 useless extension candidates. Maximal degree in co-relation 8140. Up to 1893 conditions per place. [2024-02-19 14:34:15,350 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 93 selfloop transitions, 13 changer transitions 3/113 dead transitions. [2024-02-19 14:34:15,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 113 transitions, 1173 flow [2024-02-19 14:34:15,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-02-19 14:34:15,351 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5864661654135338 [2024-02-19 14:34:15,352 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2024-02-19 14:34:15,352 INFO L507 AbstractCegarLoop]: Abstraction has has 50 places, 113 transitions, 1173 flow [2024-02-19 14:34:15,352 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:34:15,352 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:15,352 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:15,352 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:34:15,352 INFO L432 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)] === [2024-02-19 14:34:15,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1025353311, now seen corresponding path program 3 times [2024-02-19 14:34:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441212418] [2024-02-19 14:34:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:15,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:15,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441212418] [2024-02-19 14:34:15,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441212418] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:15,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:15,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:34:15,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018805205] [2024-02-19 14:34:15,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:15,858 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:34:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:15,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:34:15,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:34:15,860 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:15,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 113 transitions, 1173 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:15,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:15,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:15,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:16,482 INFO L124 PetriNetUnfolderBase]: 2696/4310 cut-off events. [2024-02-19 14:34:16,482 INFO L125 PetriNetUnfolderBase]: For 2947/3267 co-relation queries the response was YES. [2024-02-19 14:34:16,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25087 conditions, 4310 events. 2696/4310 cut-off events. For 2947/3267 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 25998 event pairs, 399 based on Foata normal form. 5/3386 useless extension candidates. Maximal degree in co-relation 18258. Up to 4082 conditions per place. [2024-02-19 14:34:16,515 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 223 selfloop transitions, 32 changer transitions 53/312 dead transitions. [2024-02-19 14:34:16,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 312 transitions, 3926 flow [2024-02-19 14:34:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:34:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:34:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-02-19 14:34:16,516 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5745614035087719 [2024-02-19 14:34:16,517 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2024-02-19 14:34:16,517 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 312 transitions, 3926 flow [2024-02-19 14:34:16,517 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:16,517 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:16,517 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:16,517 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:34:16,517 INFO L432 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)] === [2024-02-19 14:34:16,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash -967196887, now seen corresponding path program 4 times [2024-02-19 14:34:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329789749] [2024-02-19 14:34:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:16,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:16,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329789749] [2024-02-19 14:34:16,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329789749] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:16,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:16,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:34:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724276710] [2024-02-19 14:34:16,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:16,900 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:34:16,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:16,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:34:16,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:34:16,901 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:16,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 312 transitions, 3926 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:16,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:16,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:16,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:17,809 INFO L124 PetriNetUnfolderBase]: 3986/6442 cut-off events. [2024-02-19 14:34:17,810 INFO L125 PetriNetUnfolderBase]: For 7323/7629 co-relation queries the response was YES. [2024-02-19 14:34:17,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42961 conditions, 6442 events. 3986/6442 cut-off events. For 7323/7629 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 42968 event pairs, 343 based on Foata normal form. 6/5057 useless extension candidates. Maximal degree in co-relation 31368. Up to 6008 conditions per place. [2024-02-19 14:34:17,861 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 483 selfloop transitions, 39 changer transitions 95/621 dead transitions. [2024-02-19 14:34:17,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 621 transitions, 9060 flow [2024-02-19 14:34:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:34:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:34:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-02-19 14:34:17,905 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5307017543859649 [2024-02-19 14:34:17,905 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2024-02-19 14:34:17,905 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 621 transitions, 9060 flow [2024-02-19 14:34:17,906 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:17,906 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:17,906 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:17,906 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:34:17,906 INFO L432 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)] === [2024-02-19 14:34:17,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1441895691, now seen corresponding path program 5 times [2024-02-19 14:34:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:17,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214341488] [2024-02-19 14:34:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:17,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:18,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:18,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214341488] [2024-02-19 14:34:18,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214341488] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:18,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:18,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:34:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554964534] [2024-02-19 14:34:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:18,244 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:34:18,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:34:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:34:18,244 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:18,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 621 transitions, 9060 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:18,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:18,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:18,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:19,446 INFO L124 PetriNetUnfolderBase]: 3986/6411 cut-off events. [2024-02-19 14:34:19,446 INFO L125 PetriNetUnfolderBase]: For 9556/10094 co-relation queries the response was YES. [2024-02-19 14:34:19,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48910 conditions, 6411 events. 3986/6411 cut-off events. For 9556/10094 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 42575 event pairs, 343 based on Foata normal form. 13/5027 useless extension candidates. Maximal degree in co-relation 35759. Up to 6004 conditions per place. [2024-02-19 14:34:19,493 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 575 selfloop transitions, 63 changer transitions 142/784 dead transitions. [2024-02-19 14:34:19,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 784 transitions, 12980 flow [2024-02-19 14:34:19,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:34:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:34:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-02-19 14:34:19,495 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5482456140350878 [2024-02-19 14:34:19,496 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2024-02-19 14:34:19,496 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 784 transitions, 12980 flow [2024-02-19 14:34:19,496 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:19,497 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:19,497 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:19,497 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:34:19,498 INFO L432 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)] === [2024-02-19 14:34:19,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1966671835, now seen corresponding path program 6 times [2024-02-19 14:34:19,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:19,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837399366] [2024-02-19 14:34:19,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:19,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:19,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837399366] [2024-02-19 14:34:19,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837399366] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:19,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:19,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:34:19,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615899410] [2024-02-19 14:34:19,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:19,875 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:34:19,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:19,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:34:19,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:34:19,876 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:19,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 784 transitions, 12980 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:19,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:19,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:19,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:21,083 INFO L124 PetriNetUnfolderBase]: 3986/6402 cut-off events. [2024-02-19 14:34:21,083 INFO L125 PetriNetUnfolderBase]: For 12837/13519 co-relation queries the response was YES. [2024-02-19 14:34:21,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54865 conditions, 6402 events. 3986/6402 cut-off events. For 12837/13519 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 42435 event pairs, 343 based on Foata normal form. 14/5022 useless extension candidates. Maximal degree in co-relation 40174. Up to 5999 conditions per place. [2024-02-19 14:34:21,137 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 523 selfloop transitions, 60 changer transitions 192/779 dead transitions. [2024-02-19 14:34:21,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 779 transitions, 14450 flow [2024-02-19 14:34:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:34:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:34:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-02-19 14:34:21,138 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2024-02-19 14:34:21,139 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places. [2024-02-19 14:34:21,139 INFO L507 AbstractCegarLoop]: Abstraction has has 70 places, 779 transitions, 14450 flow [2024-02-19 14:34:21,139 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:21,139 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:21,139 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:21,140 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:34:21,140 INFO L432 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)] === [2024-02-19 14:34:21,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash -308418131, now seen corresponding path program 7 times [2024-02-19 14:34:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:21,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270847360] [2024-02-19 14:34:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:21,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270847360] [2024-02-19 14:34:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270847360] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:21,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:34:21,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176897376] [2024-02-19 14:34:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:21,457 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:34:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:34:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:34:21,461 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:21,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 779 transitions, 14450 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:21,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:21,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:21,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:22,805 INFO L124 PetriNetUnfolderBase]: 3995/6436 cut-off events. [2024-02-19 14:34:22,806 INFO L125 PetriNetUnfolderBase]: For 15089/15561 co-relation queries the response was YES. [2024-02-19 14:34:22,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61369 conditions, 6436 events. 3995/6436 cut-off events. For 15089/15561 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 42831 event pairs, 357 based on Foata normal form. 5/5041 useless extension candidates. Maximal degree in co-relation 44881. Up to 6050 conditions per place. [2024-02-19 14:34:22,855 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 516 selfloop transitions, 59 changer transitions 234/813 dead transitions. [2024-02-19 14:34:22,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 813 transitions, 16716 flow [2024-02-19 14:34:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:34:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:34:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-02-19 14:34:22,856 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5482456140350878 [2024-02-19 14:34:22,857 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2024-02-19 14:34:22,857 INFO L507 AbstractCegarLoop]: Abstraction has has 75 places, 813 transitions, 16716 flow [2024-02-19 14:34:22,857 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:22,857 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:22,858 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:34:22,858 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:34:22,858 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:22,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 355922343, now seen corresponding path program 8 times [2024-02-19 14:34:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023989595] [2024-02-19 14:34:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023989595] [2024-02-19 14:34:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023989595] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:23,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:34:23,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338504198] [2024-02-19 14:34:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:23,140 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:34:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:34:23,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:34:23,142 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:23,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 813 transitions, 16716 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:23,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:23,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:23,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:24,355 INFO L124 PetriNetUnfolderBase]: 3995/6446 cut-off events. [2024-02-19 14:34:24,356 INFO L125 PetriNetUnfolderBase]: For 20481/21351 co-relation queries the response was YES. [2024-02-19 14:34:24,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67389 conditions, 6446 events. 3995/6446 cut-off events. For 20481/21351 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 42982 event pairs, 361 based on Foata normal form. 6/5055 useless extension candidates. Maximal degree in co-relation 49344. Up to 6046 conditions per place. [2024-02-19 14:34:24,403 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 474 selfloop transitions, 55 changer transitions 276/809 dead transitions. [2024-02-19 14:34:24,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 809 transitions, 18246 flow [2024-02-19 14:34:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:34:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:34:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-02-19 14:34:24,407 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5570175438596491 [2024-02-19 14:34:24,408 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2024-02-19 14:34:24,408 INFO L507 AbstractCegarLoop]: Abstraction has has 80 places, 809 transitions, 18246 flow [2024-02-19 14:34:24,408 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-02-19 14:34:24,408 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:24,411 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:24,411 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 14:34:24,412 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:24,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1851687816, now seen corresponding path program 1 times [2024-02-19 14:34:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68374111] [2024-02-19 14:34:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:24,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68374111] [2024-02-19 14:34:24,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68374111] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:24,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:24,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:34:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752526337] [2024-02-19 14:34:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:24,681 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:34:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:24,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:34:24,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:34:24,683 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:24,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 809 transitions, 18246 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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) [2024-02-19 14:34:24,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:24,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:24,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:26,127 INFO L124 PetriNetUnfolderBase]: 4490/7289 cut-off events. [2024-02-19 14:34:26,127 INFO L125 PetriNetUnfolderBase]: For 29572/29968 co-relation queries the response was YES. [2024-02-19 14:34:26,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82331 conditions, 7289 events. 4490/7289 cut-off events. For 29572/29968 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 49891 event pairs, 51 based on Foata normal form. 32/5747 useless extension candidates. Maximal degree in co-relation 60197. Up to 6773 conditions per place. [2024-02-19 14:34:26,185 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 619 selfloop transitions, 43 changer transitions 277/943 dead transitions. [2024-02-19 14:34:26,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 943 transitions, 23132 flow [2024-02-19 14:34:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-02-19 14:34:26,187 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5601503759398496 [2024-02-19 14:34:26,187 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2024-02-19 14:34:26,187 INFO L507 AbstractCegarLoop]: Abstraction has has 86 places, 943 transitions, 23132 flow [2024-02-19 14:34:26,188 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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) [2024-02-19 14:34:26,188 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:26,188 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:26,188 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-19 14:34:26,188 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:26,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1452877160, now seen corresponding path program 2 times [2024-02-19 14:34:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942876697] [2024-02-19 14:34:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:26,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:26,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942876697] [2024-02-19 14:34:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942876697] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:26,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:34:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372701230] [2024-02-19 14:34:26,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:26,437 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:34:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:26,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:34:26,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:34:26,441 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:26,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 943 transitions, 23132 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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) [2024-02-19 14:34:26,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:26,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:26,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:28,189 INFO L124 PetriNetUnfolderBase]: 4703/7639 cut-off events. [2024-02-19 14:34:28,190 INFO L125 PetriNetUnfolderBase]: For 35801/36387 co-relation queries the response was YES. [2024-02-19 14:34:28,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93686 conditions, 7639 events. 4703/7639 cut-off events. For 35801/36387 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 52533 event pairs, 71 based on Foata normal form. 31/6014 useless extension candidates. Maximal degree in co-relation 67075. Up to 7122 conditions per place. [2024-02-19 14:34:28,266 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 747 selfloop transitions, 85 changer transitions 314/1150 dead transitions. [2024-02-19 14:34:28,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 1150 transitions, 30446 flow [2024-02-19 14:34:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-02-19 14:34:28,267 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2024-02-19 14:34:28,267 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2024-02-19 14:34:28,267 INFO L507 AbstractCegarLoop]: Abstraction has has 92 places, 1150 transitions, 30446 flow [2024-02-19 14:34:28,268 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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) [2024-02-19 14:34:28,268 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:28,268 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:28,268 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-19 14:34:28,268 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:28,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1560183144, now seen corresponding path program 3 times [2024-02-19 14:34:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299621469] [2024-02-19 14:34:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:28,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:28,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299621469] [2024-02-19 14:34:28,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299621469] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:28,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:28,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:34:28,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878921963] [2024-02-19 14:34:28,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:28,537 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:28,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:28,538 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:28,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 1150 transitions, 30446 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:28,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:28,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:28,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:30,882 INFO L124 PetriNetUnfolderBase]: 5365/8714 cut-off events. [2024-02-19 14:34:30,882 INFO L125 PetriNetUnfolderBase]: For 47073/47493 co-relation queries the response was YES. [2024-02-19 14:34:30,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115001 conditions, 8714 events. 5365/8714 cut-off events. For 47073/47493 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 61056 event pairs, 81 based on Foata normal form. 31/6848 useless extension candidates. Maximal degree in co-relation 81308. Up to 8124 conditions per place. [2024-02-19 14:34:30,987 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 866 selfloop transitions, 79 changer transitions 315/1264 dead transitions. [2024-02-19 14:34:30,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 1264 transitions, 35993 flow [2024-02-19 14:34:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-02-19 14:34:30,989 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6127819548872181 [2024-02-19 14:34:30,989 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2024-02-19 14:34:30,989 INFO L507 AbstractCegarLoop]: Abstraction has has 98 places, 1264 transitions, 35993 flow [2024-02-19 14:34:30,989 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:30,989 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:30,990 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:30,990 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-19 14:34:30,990 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:30,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 625074144, now seen corresponding path program 4 times [2024-02-19 14:34:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427913346] [2024-02-19 14:34:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:31,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:31,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427913346] [2024-02-19 14:34:31,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427913346] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:31,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:31,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:34:31,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817522365] [2024-02-19 14:34:31,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:31,330 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:31,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:31,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:31,333 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:31,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 1264 transitions, 35993 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:31,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:31,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:31,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:33,489 INFO L124 PetriNetUnfolderBase]: 5597/9107 cut-off events. [2024-02-19 14:34:33,489 INFO L125 PetriNetUnfolderBase]: For 58437/59067 co-relation queries the response was YES. [2024-02-19 14:34:33,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128528 conditions, 9107 events. 5597/9107 cut-off events. For 58437/59067 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 64534 event pairs, 61 based on Foata normal form. 39/7154 useless extension candidates. Maximal degree in co-relation 92305. Up to 8480 conditions per place. [2024-02-19 14:34:33,593 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 915 selfloop transitions, 87 changer transitions 316/1322 dead transitions. [2024-02-19 14:34:33,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 1322 transitions, 40283 flow [2024-02-19 14:34:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-02-19 14:34:33,594 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6203007518796992 [2024-02-19 14:34:33,595 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 67 predicate places. [2024-02-19 14:34:33,595 INFO L507 AbstractCegarLoop]: Abstraction has has 104 places, 1322 transitions, 40283 flow [2024-02-19 14:34:33,595 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:33,595 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:33,595 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:33,595 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-19 14:34:33,595 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:33,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 799037374, now seen corresponding path program 5 times [2024-02-19 14:34:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:33,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304524109] [2024-02-19 14:34:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304524109] [2024-02-19 14:34:33,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304524109] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:33,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:33,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:34:33,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101983217] [2024-02-19 14:34:33,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:33,862 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:33,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:33,862 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:33,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 1322 transitions, 40283 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:33,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:33,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:33,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:36,405 INFO L124 PetriNetUnfolderBase]: 5582/9086 cut-off events. [2024-02-19 14:34:36,405 INFO L125 PetriNetUnfolderBase]: For 68666/69290 co-relation queries the response was YES. [2024-02-19 14:34:36,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136517 conditions, 9086 events. 5582/9086 cut-off events. For 68666/69290 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 64365 event pairs, 45 based on Foata normal form. 36/7136 useless extension candidates. Maximal degree in co-relation 103339. Up to 8449 conditions per place. [2024-02-19 14:34:36,501 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 903 selfloop transitions, 87 changer transitions 317/1311 dead transitions. [2024-02-19 14:34:36,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 1311 transitions, 42558 flow [2024-02-19 14:34:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-02-19 14:34:36,504 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6127819548872181 [2024-02-19 14:34:36,504 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 73 predicate places. [2024-02-19 14:34:36,504 INFO L507 AbstractCegarLoop]: Abstraction has has 110 places, 1311 transitions, 42558 flow [2024-02-19 14:34:36,504 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:36,505 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:36,505 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:36,505 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-19 14:34:36,505 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:36,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash 371628638, now seen corresponding path program 6 times [2024-02-19 14:34:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:36,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376111853] [2024-02-19 14:34:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376111853] [2024-02-19 14:34:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376111853] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:36,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:34:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668503645] [2024-02-19 14:34:36,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:36,693 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 14:34:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 14:34:36,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-02-19 14:34:36,694 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:36,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 1311 transitions, 42558 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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) [2024-02-19 14:34:36,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:36,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:36,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:39,872 INFO L124 PetriNetUnfolderBase]: 5864/9602 cut-off events. [2024-02-19 14:34:39,872 INFO L125 PetriNetUnfolderBase]: For 83870/84176 co-relation queries the response was YES. [2024-02-19 14:34:39,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152865 conditions, 9602 events. 5864/9602 cut-off events. For 83870/84176 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 69258 event pairs, 45 based on Foata normal form. 24/7522 useless extension candidates. Maximal degree in co-relation 117395. Up to 8907 conditions per place. [2024-02-19 14:34:39,968 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 955 selfloop transitions, 87 changer transitions 321/1367 dead transitions. [2024-02-19 14:34:39,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 1367 transitions, 47112 flow [2024-02-19 14:34:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-02-19 14:34:39,972 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6015037593984962 [2024-02-19 14:34:39,972 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 79 predicate places. [2024-02-19 14:34:39,972 INFO L507 AbstractCegarLoop]: Abstraction has has 116 places, 1367 transitions, 47112 flow [2024-02-19 14:34:39,972 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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) [2024-02-19 14:34:39,973 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:39,973 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:39,973 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-19 14:34:39,973 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:39,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 820342496, now seen corresponding path program 7 times [2024-02-19 14:34:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99154471] [2024-02-19 14:34:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:40,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:40,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99154471] [2024-02-19 14:34:40,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99154471] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:40,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:40,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:34:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333591960] [2024-02-19 14:34:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:40,296 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:40,297 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:40,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 1367 transitions, 47112 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:40,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:40,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:40,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:43,283 INFO L124 PetriNetUnfolderBase]: 6011/9850 cut-off events. [2024-02-19 14:34:43,283 INFO L125 PetriNetUnfolderBase]: For 95819/96283 co-relation queries the response was YES. [2024-02-19 14:34:43,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166248 conditions, 9850 events. 6011/9850 cut-off events. For 95819/96283 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 71051 event pairs, 81 based on Foata normal form. 36/7712 useless extension candidates. Maximal degree in co-relation 122639. Up to 9154 conditions per place. [2024-02-19 14:34:43,460 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 989 selfloop transitions, 90 changer transitions 324/1407 dead transitions. [2024-02-19 14:34:43,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1407 transitions, 51305 flow [2024-02-19 14:34:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-02-19 14:34:43,462 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5939849624060151 [2024-02-19 14:34:43,462 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 85 predicate places. [2024-02-19 14:34:43,462 INFO L507 AbstractCegarLoop]: Abstraction has has 122 places, 1407 transitions, 51305 flow [2024-02-19 14:34:43,462 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:43,462 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:43,462 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:43,463 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-19 14:34:43,463 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:43,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1838532540, now seen corresponding path program 8 times [2024-02-19 14:34:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702512094] [2024-02-19 14:34:43,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702512094] [2024-02-19 14:34:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702512094] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:43,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:43,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:34:43,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321495958] [2024-02-19 14:34:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:43,702 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:43,703 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:43,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 1407 transitions, 51305 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:43,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:43,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:43,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:46,650 INFO L124 PetriNetUnfolderBase]: 5998/9844 cut-off events. [2024-02-19 14:34:46,651 INFO L125 PetriNetUnfolderBase]: For 110427/110785 co-relation queries the response was YES. [2024-02-19 14:34:46,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174869 conditions, 9844 events. 5998/9844 cut-off events. For 110427/110785 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 71448 event pairs, 45 based on Foata normal form. 10/7688 useless extension candidates. Maximal degree in co-relation 135285. Up to 9125 conditions per place. [2024-02-19 14:34:46,876 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 978 selfloop transitions, 85 changer transitions 329/1396 dead transitions. [2024-02-19 14:34:46,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 1396 transitions, 53684 flow [2024-02-19 14:34:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2024-02-19 14:34:46,877 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.575187969924812 [2024-02-19 14:34:46,878 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 91 predicate places. [2024-02-19 14:34:46,878 INFO L507 AbstractCegarLoop]: Abstraction has has 128 places, 1396 transitions, 53684 flow [2024-02-19 14:34:46,878 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:46,878 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:46,878 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:46,878 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-19 14:34:46,878 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:46,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:46,879 INFO L85 PathProgramCache]: Analyzing trace with hash 783596912, now seen corresponding path program 9 times [2024-02-19 14:34:46,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:46,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043909472] [2024-02-19 14:34:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:46,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:47,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:47,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043909472] [2024-02-19 14:34:47,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043909472] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:47,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:47,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:34:47,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142522319] [2024-02-19 14:34:47,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:47,165 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:47,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:47,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:47,165 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:47,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 1396 transitions, 53684 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:47,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:47,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:47,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:50,770 INFO L124 PetriNetUnfolderBase]: 6594/10828 cut-off events. [2024-02-19 14:34:50,771 INFO L125 PetriNetUnfolderBase]: For 132090/132606 co-relation queries the response was YES. [2024-02-19 14:34:50,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202686 conditions, 10828 events. 6594/10828 cut-off events. For 132090/132606 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 79984 event pairs, 49 based on Foata normal form. 33/8438 useless extension candidates. Maximal degree in co-relation 160879. Up to 10053 conditions per place. [2024-02-19 14:34:50,912 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 1082 selfloop transitions, 120 changer transitions 335/1541 dead transitions. [2024-02-19 14:34:50,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 1541 transitions, 62346 flow [2024-02-19 14:34:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-02-19 14:34:50,914 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-02-19 14:34:50,914 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 97 predicate places. [2024-02-19 14:34:50,914 INFO L507 AbstractCegarLoop]: Abstraction has has 134 places, 1541 transitions, 62346 flow [2024-02-19 14:34:50,914 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:50,914 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:50,915 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:50,915 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-19 14:34:50,915 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:50,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash 957560142, now seen corresponding path program 10 times [2024-02-19 14:34:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283492071] [2024-02-19 14:34:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283492071] [2024-02-19 14:34:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283492071] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:51,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:51,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:34:51,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973366637] [2024-02-19 14:34:51,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:51,269 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:51,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:51,270 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:51,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 1541 transitions, 62346 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:51,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:51,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:51,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:55,328 INFO L124 PetriNetUnfolderBase]: 6648/10965 cut-off events. [2024-02-19 14:34:55,328 INFO L125 PetriNetUnfolderBase]: For 154824/155878 co-relation queries the response was YES. [2024-02-19 14:34:55,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215086 conditions, 10965 events. 6648/10965 cut-off events. For 154824/155878 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 81499 event pairs, 51 based on Foata normal form. 16/8531 useless extension candidates. Maximal degree in co-relation 164061. Up to 10163 conditions per place. [2024-02-19 14:34:55,470 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 1109 selfloop transitions, 123 changer transitions 337/1573 dead transitions. [2024-02-19 14:34:55,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 1573 transitions, 66782 flow [2024-02-19 14:34:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:34:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:34:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-02-19 14:34:55,471 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-02-19 14:34:55,471 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 103 predicate places. [2024-02-19 14:34:55,471 INFO L507 AbstractCegarLoop]: Abstraction has has 140 places, 1573 transitions, 66782 flow [2024-02-19 14:34:55,472 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:55,472 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:34:55,472 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:34:55,472 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-19 14:34:55,472 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:34:55,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:34:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash 42772330, now seen corresponding path program 11 times [2024-02-19 14:34:55,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:34:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132634300] [2024-02-19 14:34:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:34:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:34:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:34:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:34:55,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:34:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132634300] [2024-02-19 14:34:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132634300] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:34:55,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:34:55,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:34:55,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748122512] [2024-02-19 14:34:55,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:34:55,715 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:34:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:34:55,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:34:55,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:34:55,716 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:34:55,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 1573 transitions, 66782 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:34:55,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:34:55,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:34:55,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:34:59,868 INFO L124 PetriNetUnfolderBase]: 6625/10904 cut-off events. [2024-02-19 14:34:59,868 INFO L125 PetriNetUnfolderBase]: For 164477/165045 co-relation queries the response was YES. [2024-02-19 14:34:59,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224364 conditions, 10904 events. 6625/10904 cut-off events. For 164477/165045 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 80761 event pairs, 65 based on Foata normal form. 36/8496 useless extension candidates. Maximal degree in co-relation 172011. Up to 10124 conditions per place. [2024-02-19 14:35:00,033 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 1101 selfloop transitions, 119 changer transitions 338/1562 dead transitions. [2024-02-19 14:35:00,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 1562 transitions, 69427 flow [2024-02-19 14:35:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:35:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:35:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-02-19 14:35:00,035 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5977443609022557 [2024-02-19 14:35:00,035 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 109 predicate places. [2024-02-19 14:35:00,035 INFO L507 AbstractCegarLoop]: Abstraction has has 146 places, 1562 transitions, 69427 flow [2024-02-19 14:35:00,035 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:35:00,035 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:00,036 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:35:00,036 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-19 14:35:00,036 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:35:00,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1678864590, now seen corresponding path program 12 times [2024-02-19 14:35:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:00,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585240610] [2024-02-19 14:35:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:35:00,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:00,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585240610] [2024-02-19 14:35:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585240610] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:00,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:35:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568130305] [2024-02-19 14:35:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:00,322 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:35:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:35:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:35:00,323 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:35:00,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 1562 transitions, 69427 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:35:00,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:00,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:35:00,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:04,518 INFO L124 PetriNetUnfolderBase]: 6628/10924 cut-off events. [2024-02-19 14:35:04,518 INFO L125 PetriNetUnfolderBase]: For 177924/178866 co-relation queries the response was YES. [2024-02-19 14:35:04,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235223 conditions, 10924 events. 6628/10924 cut-off events. For 177924/178866 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 81027 event pairs, 81 based on Foata normal form. 17/8493 useless extension candidates. Maximal degree in co-relation 179388. Up to 10156 conditions per place. [2024-02-19 14:35:04,674 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 1105 selfloop transitions, 113 changer transitions 363/1585 dead transitions. [2024-02-19 14:35:04,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1585 transitions, 73631 flow [2024-02-19 14:35:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:35:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:35:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2024-02-19 14:35:04,675 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5827067669172933 [2024-02-19 14:35:04,676 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 115 predicate places. [2024-02-19 14:35:04,676 INFO L507 AbstractCegarLoop]: Abstraction has has 152 places, 1585 transitions, 73631 flow [2024-02-19 14:35:04,676 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:35:04,676 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:04,676 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:35:04,676 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-19 14:35:04,676 INFO L432 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:35:04,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -883814312, now seen corresponding path program 13 times [2024-02-19 14:35:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:04,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645190889] [2024-02-19 14:35:04,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:35:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:05,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645190889] [2024-02-19 14:35:05,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645190889] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:05,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:05,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:35:05,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085844715] [2024-02-19 14:35:05,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:05,075 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:35:05,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:35:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:35:05,076 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:35:05,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 1585 transitions, 73631 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:35:05,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:05,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:35:05,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:35:09,346 INFO L124 PetriNetUnfolderBase]: 6649/10972 cut-off events. [2024-02-19 14:35:09,346 INFO L125 PetriNetUnfolderBase]: For 200042/200662 co-relation queries the response was YES. [2024-02-19 14:35:09,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246089 conditions, 10972 events. 6649/10972 cut-off events. For 200042/200662 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 81628 event pairs, 65 based on Foata normal form. 28/8540 useless extension candidates. Maximal degree in co-relation 189001. Up to 10185 conditions per place. [2024-02-19 14:35:09,504 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 1096 selfloop transitions, 120 changer transitions 366/1586 dead transitions. [2024-02-19 14:35:09,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1586 transitions, 76832 flow [2024-02-19 14:35:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:35:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:35:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-02-19 14:35:09,505 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5902255639097744 [2024-02-19 14:35:09,506 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 121 predicate places. [2024-02-19 14:35:09,506 INFO L507 AbstractCegarLoop]: Abstraction has has 158 places, 1586 transitions, 76832 flow [2024-02-19 14:35:09,506 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:35:09,506 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:35:09,506 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-02-19 14:35:09,506 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-19 14:35:09,506 INFO L432 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 14:35:09,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:35:09,507 INFO L85 PathProgramCache]: Analyzing trace with hash 339214110, now seen corresponding path program 14 times [2024-02-19 14:35:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:35:09,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125672988] [2024-02-19 14:35:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:35:09,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:35:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:35:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:35:09,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:35:09,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125672988] [2024-02-19 14:35:09,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125672988] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:35:09,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:35:09,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 14:35:09,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827315296] [2024-02-19 14:35:09,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:35:09,748 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:35:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:35:09,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:35:09,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:35:09,749 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-02-19 14:35:09,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 1586 transitions, 76832 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-02-19 14:35:09,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:35:09,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-02-19 14:35:09,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand