./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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/popl20-bad-ring.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 e1611f006d8b4d3ca09ba5acfb7e64e93bdf2d1c3a87f0ab00b1667331afb989 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:07:41,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:07:41,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 12:07:41,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:07:41,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:07:41,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:07:41,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:07:41,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:07:41,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:07:41,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:07:41,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:07:41,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:07:41,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:07:41,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:07:41,268 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:07:41,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:07:41,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:07:41,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:07:41,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 12:07:41,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:07:41,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:07:41,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:07:41,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:07:41,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:07:41,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:07:41,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:07:41,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:07:41,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:07:41,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:07:41,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:07:41,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:07:41,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:07:41,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:07:41,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:07:41,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:07:41,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:07:41,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 12:07:41,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 12:07:41,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:07:41,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:07:41,287 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:07:41,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:07:41,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:07:41,288 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 -> e1611f006d8b4d3ca09ba5acfb7e64e93bdf2d1c3a87f0ab00b1667331afb989 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:07:41,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:07:41,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:07:41,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:07:41,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:07:41,552 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:07:41,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-02-20 12:07:42,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:07:42,885 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:07:42,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-02-20 12:07:42,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea7b304c7/5c13673c29154acf84e29e665d4b9681/FLAG538153fb4 [2024-02-20 12:07:42,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea7b304c7/5c13673c29154acf84e29e665d4b9681 [2024-02-20 12:07:42,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:07:42,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:07:42,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:07:42,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:07:42,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:07:42,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:07:42" (1/1) ... [2024-02-20 12:07:42,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656aefab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:42, skipping insertion in model container [2024-02-20 12:07:42,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:07:42" (1/1) ... [2024-02-20 12:07:42,944 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:07:43,129 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/popl20-bad-ring.wvr.c[3947,3960] [2024-02-20 12:07:43,139 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:07:43,155 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:07:43,183 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/popl20-bad-ring.wvr.c[3947,3960] [2024-02-20 12:07:43,191 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:07:43,213 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:07:43,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43 WrapperNode [2024-02-20 12:07:43,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:07:43,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:07:43,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:07:43,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:07:43,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,298 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 327 [2024-02-20 12:07:43,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:07:43,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:07:43,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:07:43,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:07:43,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,331 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 10, 2, 2, 2]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 3, 1, 1, 1]. [2024-02-20 12:07:43,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:07:43,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:07:43,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:07:43,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:07:43,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (1/1) ... [2024-02-20 12:07:43,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:07:43,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:07:43,390 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-20 12:07:43,397 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-20 12:07:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:07:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:07:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 12:07:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 12:07:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:07:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:07:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:07:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 12:07:43,435 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:07:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:07:43,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:07:43,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:07:43,437 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:07:43,543 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:07:43,545 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:07:43,979 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:07:43,979 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:07:44,287 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:07:44,288 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-02-20 12:07:44,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:07:44 BoogieIcfgContainer [2024-02-20 12:07:44,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:07:44,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:07:44,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:07:44,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:07:44,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:07:42" (1/3) ... [2024-02-20 12:07:44,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abf30a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:07:44, skipping insertion in model container [2024-02-20 12:07:44,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:43" (2/3) ... [2024-02-20 12:07:44,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abf30a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:07:44, skipping insertion in model container [2024-02-20 12:07:44,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:07:44" (3/3) ... [2024-02-20 12:07:44,299 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2024-02-20 12:07:44,314 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:07:44,315 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:07:44,315 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:07:44,374 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 12:07:44,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 121 flow [2024-02-20 12:07:44,485 INFO L124 PetriNetUnfolderBase]: 8/47 cut-off events. [2024-02-20 12:07:44,486 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:07:44,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 8/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-02-20 12:07:44,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 50 transitions, 121 flow [2024-02-20 12:07:44,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 46 transitions, 110 flow [2024-02-20 12:07:44,520 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:07:44,525 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;@4b2fa16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:07:44,525 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 12:07:44,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:07:44,548 INFO L124 PetriNetUnfolderBase]: 8/45 cut-off events. [2024-02-20 12:07:44,548 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:07:44,549 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:44,549 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-20 12:07:44,550 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-20 12:07:44,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 86966537, now seen corresponding path program 1 times [2024-02-20 12:07:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:44,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116783718] [2024-02-20 12:07:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:44,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:44,864 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-20 12:07:44,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:44,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116783718] [2024-02-20 12:07:44,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116783718] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:44,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:44,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:07:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118489916] [2024-02-20 12:07:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:44,910 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-20 12:07:44,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:44,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-20 12:07:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-20 12:07:44,967 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:44,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-20 12:07:44,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:44,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:44,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:45,400 INFO L124 PetriNetUnfolderBase]: 1093/1894 cut-off events. [2024-02-20 12:07:45,401 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-02-20 12:07:45,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3483 conditions, 1894 events. 1093/1894 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10167 event pairs, 902 based on Foata normal form. 176/1899 useless extension candidates. Maximal degree in co-relation 3128. Up to 1468 conditions per place. [2024-02-20 12:07:45,421 INFO L140 encePairwiseOnDemand]: 48/50 looper letters, 34 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2024-02-20 12:07:45,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 174 flow [2024-02-20 12:07:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-20 12:07:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-20 12:07:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2024-02-20 12:07:45,435 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-02-20 12:07:45,439 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-02-20 12:07:45,439 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 174 flow [2024-02-20 12:07:45,440 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-20 12:07:45,440 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:45,440 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, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:45,440 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 12:07:45,441 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-20 12:07:45,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:45,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1927679043, now seen corresponding path program 1 times [2024-02-20 12:07:45,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:45,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219287470] [2024-02-20 12:07:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:45,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:45,622 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-20 12:07:45,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:45,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219287470] [2024-02-20 12:07:45,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219287470] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:45,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:07:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765038668] [2024-02-20 12:07:45,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:45,625 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:07:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:45,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:07:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:07:45,627 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:45,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 12:07:45,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:45,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:45,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:45,988 INFO L124 PetriNetUnfolderBase]: 1084/1809 cut-off events. [2024-02-20 12:07:45,989 INFO L125 PetriNetUnfolderBase]: For 262/358 co-relation queries the response was YES. [2024-02-20 12:07:45,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4970 conditions, 1809 events. 1084/1809 cut-off events. For 262/358 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9202 event pairs, 281 based on Foata normal form. 33/1734 useless extension candidates. Maximal degree in co-relation 4518. Up to 1517 conditions per place. [2024-02-20 12:07:46,006 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 44 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2024-02-20 12:07:46,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 326 flow [2024-02-20 12:07:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:07:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:07:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-20 12:07:46,008 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-02-20 12:07:46,009 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2024-02-20 12:07:46,009 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 57 transitions, 326 flow [2024-02-20 12:07:46,010 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 12:07:46,010 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:46,011 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, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:46,011 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 12:07:46,012 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-20 12:07:46,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash 770590175, now seen corresponding path program 2 times [2024-02-20 12:07:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:46,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691335066] [2024-02-20 12:07:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:46,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:46,201 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-20 12:07:46,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691335066] [2024-02-20 12:07:46,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691335066] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:46,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:46,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:07:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597483208] [2024-02-20 12:07:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:46,209 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:07:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:07:46,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:07:46,211 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:46,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 57 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 12:07:46,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:46,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:46,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:46,490 INFO L124 PetriNetUnfolderBase]: 914/1622 cut-off events. [2024-02-20 12:07:46,490 INFO L125 PetriNetUnfolderBase]: For 662/828 co-relation queries the response was YES. [2024-02-20 12:07:46,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 1622 events. 914/1622 cut-off events. For 662/828 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8328 event pairs, 165 based on Foata normal form. 48/1555 useless extension candidates. Maximal degree in co-relation 5045. Up to 1309 conditions per place. [2024-02-20 12:07:46,508 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 56 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-02-20 12:07:46,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 514 flow [2024-02-20 12:07:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:07:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:07:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-02-20 12:07:46,509 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2024-02-20 12:07:46,510 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2024-02-20 12:07:46,510 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 68 transitions, 514 flow [2024-02-20 12:07:46,510 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 12:07:46,510 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:46,511 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, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:46,511 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 12:07:46,511 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-20 12:07:46,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash -818306137, now seen corresponding path program 3 times [2024-02-20 12:07:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:46,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114145185] [2024-02-20 12:07:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:46,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:46,583 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-20 12:07:46,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:46,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114145185] [2024-02-20 12:07:46,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114145185] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:46,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:07:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975926246] [2024-02-20 12:07:46,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:46,585 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:07:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:07:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:07:46,586 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:46,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 68 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 12:07:46,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:46,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:46,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:46,961 INFO L124 PetriNetUnfolderBase]: 1444/2604 cut-off events. [2024-02-20 12:07:46,962 INFO L125 PetriNetUnfolderBase]: For 1889/2205 co-relation queries the response was YES. [2024-02-20 12:07:46,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11166 conditions, 2604 events. 1444/2604 cut-off events. For 1889/2205 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15286 event pairs, 219 based on Foata normal form. 1/2411 useless extension candidates. Maximal degree in co-relation 9658. Up to 2086 conditions per place. [2024-02-20 12:07:46,983 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 76 selfloop transitions, 3 changer transitions 11/100 dead transitions. [2024-02-20 12:07:46,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 100 transitions, 971 flow [2024-02-20 12:07:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:07:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:07:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-02-20 12:07:46,987 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2024-02-20 12:07:46,989 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2024-02-20 12:07:46,990 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 100 transitions, 971 flow [2024-02-20 12:07:46,990 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 12:07:46,991 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:46,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:46,991 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 12:07:46,991 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-20 12:07:46,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1601414665, now seen corresponding path program 1 times [2024-02-20 12:07:46,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:46,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976759935] [2024-02-20 12:07:46,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:07:47,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:47,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976759935] [2024-02-20 12:07:47,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976759935] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:47,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:47,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:07:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258123971] [2024-02-20 12:07:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:47,117 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:07:47,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:47,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:07:47,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:07:47,119 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:47,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 100 transitions, 971 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:07:47,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:47,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:47,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:47,361 INFO L124 PetriNetUnfolderBase]: 851/1517 cut-off events. [2024-02-20 12:07:47,361 INFO L125 PetriNetUnfolderBase]: For 1630/1974 co-relation queries the response was YES. [2024-02-20 12:07:47,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8112 conditions, 1517 events. 851/1517 cut-off events. For 1630/1974 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8281 event pairs, 87 based on Foata normal form. 44/1481 useless extension candidates. Maximal degree in co-relation 6574. Up to 1297 conditions per place. [2024-02-20 12:07:47,375 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 61 selfloop transitions, 2 changer transitions 16/89 dead transitions. [2024-02-20 12:07:47,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 1013 flow [2024-02-20 12:07:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:07:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:07:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-02-20 12:07:47,376 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2024-02-20 12:07:47,377 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2024-02-20 12:07:47,377 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 89 transitions, 1013 flow [2024-02-20 12:07:47,377 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:07:47,377 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:47,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:47,378 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 12:07:47,378 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-20 12:07:47,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1384718017, now seen corresponding path program 2 times [2024-02-20 12:07:47,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:47,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262015497] [2024-02-20 12:07:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:47,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:07:47,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262015497] [2024-02-20 12:07:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262015497] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:07:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961279598] [2024-02-20 12:07:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:47,507 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:07:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:07:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:07:47,509 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:47,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 89 transitions, 1013 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:07:47,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:47,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:47,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:47,874 INFO L124 PetriNetUnfolderBase]: 900/1642 cut-off events. [2024-02-20 12:07:47,874 INFO L125 PetriNetUnfolderBase]: For 2478/2940 co-relation queries the response was YES. [2024-02-20 12:07:47,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10124 conditions, 1642 events. 900/1642 cut-off events. For 2478/2940 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9034 event pairs, 134 based on Foata normal form. 27/1587 useless extension candidates. Maximal degree in co-relation 8671. Up to 1392 conditions per place. [2024-02-20 12:07:47,889 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 62 selfloop transitions, 2 changer transitions 31/105 dead transitions. [2024-02-20 12:07:47,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 1404 flow [2024-02-20 12:07:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:07:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:07:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-02-20 12:07:47,891 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.468 [2024-02-20 12:07:47,893 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2024-02-20 12:07:47,893 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 105 transitions, 1404 flow [2024-02-20 12:07:47,894 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:07:47,894 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:47,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:47,894 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 12:07:47,895 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-20 12:07:47,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1254393547, now seen corresponding path program 1 times [2024-02-20 12:07:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:47,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503157977] [2024-02-20 12:07:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:07:48,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503157977] [2024-02-20 12:07:48,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503157977] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:48,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:48,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:07:48,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775867648] [2024-02-20 12:07:48,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:48,082 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:07:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:48,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:07:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:07:48,083 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:48,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 105 transitions, 1404 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-20 12:07:48,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:48,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:48,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:48,357 INFO L124 PetriNetUnfolderBase]: 1094/2014 cut-off events. [2024-02-20 12:07:48,358 INFO L125 PetriNetUnfolderBase]: For 3643/4431 co-relation queries the response was YES. [2024-02-20 12:07:48,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14450 conditions, 2014 events. 1094/2014 cut-off events. For 3643/4431 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11336 event pairs, 238 based on Foata normal form. 22/1950 useless extension candidates. Maximal degree in co-relation 9864. Up to 1748 conditions per place. [2024-02-20 12:07:48,380 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 63 selfloop transitions, 2 changer transitions 71/146 dead transitions. [2024-02-20 12:07:48,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 146 transitions, 2277 flow [2024-02-20 12:07:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:07:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:07:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-02-20 12:07:48,381 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.535 [2024-02-20 12:07:48,382 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2024-02-20 12:07:48,382 INFO L507 AbstractCegarLoop]: Abstraction has has 64 places, 146 transitions, 2277 flow [2024-02-20 12:07:48,382 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-20 12:07:48,382 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:48,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:48,383 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 12:07:48,383 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-20 12:07:48,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -54914021, now seen corresponding path program 1 times [2024-02-20 12:07:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576916870] [2024-02-20 12:07:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:48,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:48,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576916870] [2024-02-20 12:07:48,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576916870] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:48,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:48,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:07:48,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695685240] [2024-02-20 12:07:48,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:48,532 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:07:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:07:48,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:07:48,533 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:48,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 146 transitions, 2277 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-20 12:07:48,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:48,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:48,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:49,052 INFO L124 PetriNetUnfolderBase]: 1639/3107 cut-off events. [2024-02-20 12:07:49,053 INFO L125 PetriNetUnfolderBase]: For 6564/7766 co-relation queries the response was YES. [2024-02-20 12:07:49,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25149 conditions, 3107 events. 1639/3107 cut-off events. For 6564/7766 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 19142 event pairs, 502 based on Foata normal form. 26/3005 useless extension candidates. Maximal degree in co-relation 11055. Up to 2709 conditions per place. [2024-02-20 12:07:49,077 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 64 selfloop transitions, 2 changer transitions 158/234 dead transitions. [2024-02-20 12:07:49,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 234 transitions, 4196 flow [2024-02-20 12:07:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:07:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:07:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-02-20 12:07:49,079 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-02-20 12:07:49,080 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2024-02-20 12:07:49,080 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 234 transitions, 4196 flow [2024-02-20 12:07:49,081 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-20 12:07:49,081 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:49,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:49,081 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 12:07:49,081 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-20 12:07:49,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 299770607, now seen corresponding path program 1 times [2024-02-20 12:07:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671238370] [2024-02-20 12:07:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:49,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:49,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671238370] [2024-02-20 12:07:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671238370] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:07:49,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615486515] [2024-02-20 12:07:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:49,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:07:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:07:49,366 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-20 12:07:49,390 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-20 12:07:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:49,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 12:07:49,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:07:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:49,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:07:49,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-02-20 12:07:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615486515] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:07:49,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:07:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-02-20 12:07:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471909979] [2024-02-20 12:07:49,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:07:49,941 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-20 12:07:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:49,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-20 12:07:49,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-02-20 12:07:49,943 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:49,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 234 transitions, 4196 flow. Second operand has 18 states, 18 states have (on average 17.555555555555557) internal successors, (316), 18 states have internal predecessors, (316), 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-20 12:07:49,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:49,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:49,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:50,973 INFO L124 PetriNetUnfolderBase]: 2848/5474 cut-off events. [2024-02-20 12:07:50,973 INFO L125 PetriNetUnfolderBase]: For 16673/19145 co-relation queries the response was YES. [2024-02-20 12:07:50,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48525 conditions, 5474 events. 2848/5474 cut-off events. For 16673/19145 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 38652 event pairs, 700 based on Foata normal form. 37/5259 useless extension candidates. Maximal degree in co-relation 10805. Up to 4712 conditions per place. [2024-02-20 12:07:50,998 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 63 selfloop transitions, 4 changer transitions 347/424 dead transitions. [2024-02-20 12:07:50,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 424 transitions, 8567 flow [2024-02-20 12:07:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 12:07:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 12:07:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 287 transitions. [2024-02-20 12:07:50,999 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44153846153846155 [2024-02-20 12:07:51,000 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2024-02-20 12:07:51,000 INFO L507 AbstractCegarLoop]: Abstraction has has 79 places, 424 transitions, 8567 flow [2024-02-20 12:07:51,000 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.555555555555557) internal successors, (316), 18 states have internal predecessors, (316), 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-20 12:07:51,001 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:51,001 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:51,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-20 12:07:51,214 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:07:51,215 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-20 12:07:51,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 609739639, now seen corresponding path program 2 times [2024-02-20 12:07:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900179538] [2024-02-20 12:07:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:51,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:51,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900179538] [2024-02-20 12:07:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900179538] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:07:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561460642] [2024-02-20 12:07:51,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:07:51,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:07:51,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:07:51,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:07:52,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-20 12:07:52,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:07:52,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:07:52,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-20 12:07:52,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:07:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:07:52,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:07:52,293 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-02-20 12:07:52,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-02-20 12:07:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-20 12:07:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561460642] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:07:52,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:07:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 16 [2024-02-20 12:07:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750913624] [2024-02-20 12:07:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:52,316 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:07:52,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:52,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:07:52,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-02-20 12:07:52,324 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-02-20 12:07:52,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 424 transitions, 8567 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-20 12:07:52,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:52,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-02-20 12:07:52,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:53,598 INFO L124 PetriNetUnfolderBase]: 3982/7232 cut-off events. [2024-02-20 12:07:53,599 INFO L125 PetriNetUnfolderBase]: For 37052/39516 co-relation queries the response was YES. [2024-02-20 12:07:53,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67014 conditions, 7232 events. 3982/7232 cut-off events. For 37052/39516 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 49344 event pairs, 912 based on Foata normal form. 2/6841 useless extension candidates. Maximal degree in co-relation 17878. Up to 5846 conditions per place. [2024-02-20 12:07:53,658 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 91 selfloop transitions, 7 changer transitions 488/594 dead transitions. [2024-02-20 12:07:53,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 594 transitions, 13226 flow [2024-02-20 12:07:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:07:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:07:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-02-20 12:07:53,660 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.512 [2024-02-20 12:07:53,660 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2024-02-20 12:07:53,660 INFO L507 AbstractCegarLoop]: Abstraction has has 83 places, 594 transitions, 13226 flow [2024-02-20 12:07:53,661 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-20 12:07:53,661 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:53,661 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:53,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-20 12:07:53,876 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-20 12:07:53,877 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-20 12:07:53,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash -365915693, now seen corresponding path program 1 times [2024-02-20 12:07:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:53,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209613274] [2024-02-20 12:07:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:53,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-20 12:07:53,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:53,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209613274] [2024-02-20 12:07:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209613274] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:07:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426074556] [2024-02-20 12:07:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:53,996 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:07:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:07:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:07:53,997 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:53,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 594 transitions, 13226 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-20 12:07:53,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:53,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:53,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:55,302 INFO L124 PetriNetUnfolderBase]: 4194/7512 cut-off events. [2024-02-20 12:07:55,302 INFO L125 PetriNetUnfolderBase]: For 56826/57770 co-relation queries the response was YES. [2024-02-20 12:07:55,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75621 conditions, 7512 events. 4194/7512 cut-off events. For 56826/57770 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 50816 event pairs, 854 based on Foata normal form. 235/7398 useless extension candidates. Maximal degree in co-relation 34580. Up to 6066 conditions per place. [2024-02-20 12:07:55,367 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 123 selfloop transitions, 12 changer transitions 513/659 dead transitions. [2024-02-20 12:07:55,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 659 transitions, 16000 flow [2024-02-20 12:07:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:07:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:07:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-02-20 12:07:55,369 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-02-20 12:07:55,369 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2024-02-20 12:07:55,369 INFO L507 AbstractCegarLoop]: Abstraction has has 86 places, 659 transitions, 16000 flow [2024-02-20 12:07:55,370 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-20 12:07:55,370 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:55,370 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:55,370 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-20 12:07:55,371 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-20 12:07:55,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:55,371 INFO L85 PathProgramCache]: Analyzing trace with hash -790026523, now seen corresponding path program 2 times [2024-02-20 12:07:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004028329] [2024-02-20 12:07:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 12:07:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004028329] [2024-02-20 12:07:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004028329] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:07:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568188597] [2024-02-20 12:07:55,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:07:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:07:55,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:07:55,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:07:55,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-20 12:07:55,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:07:55,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:07:55,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 12:07:55,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:07:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 12:07:55,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:07:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 12:07:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568188597] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:07:56,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:07:56,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-02-20 12:07:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376476434] [2024-02-20 12:07:56,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:07:56,032 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-20 12:07:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:56,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-20 12:07:56,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-02-20 12:07:56,033 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-02-20 12:07:56,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 659 transitions, 16000 flow. Second operand has 18 states, 18 states have (on average 18.11111111111111) internal successors, (326), 18 states have internal predecessors, (326), 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-20 12:07:56,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:56,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-02-20 12:07:56,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:58,409 INFO L124 PetriNetUnfolderBase]: 6608/12012 cut-off events. [2024-02-20 12:07:58,409 INFO L125 PetriNetUnfolderBase]: For 96112/98208 co-relation queries the response was YES. [2024-02-20 12:07:58,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129584 conditions, 12012 events. 6608/12012 cut-off events. For 96112/98208 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 89371 event pairs, 1360 based on Foata normal form. 126/11579 useless extension candidates. Maximal degree in co-relation 32686. Up to 9612 conditions per place. [2024-02-20 12:07:58,504 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 131 selfloop transitions, 5 changer transitions 966/1113 dead transitions. [2024-02-20 12:07:58,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 1113 transitions, 29385 flow [2024-02-20 12:07:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 12:07:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 12:07:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 289 transitions. [2024-02-20 12:07:58,507 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44461538461538463 [2024-02-20 12:07:58,507 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 50 predicate places. [2024-02-20 12:07:58,507 INFO L507 AbstractCegarLoop]: Abstraction has has 98 places, 1113 transitions, 29385 flow [2024-02-20 12:07:58,507 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.11111111111111) internal successors, (326), 18 states have internal predecessors, (326), 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-20 12:07:58,508 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:58,508 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:58,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-20 12:07:58,721 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:07:58,722 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-20 12:07:58,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash 350169857, now seen corresponding path program 3 times [2024-02-20 12:07:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:58,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11037405] [2024-02-20 12:07:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:08:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11037405] [2024-02-20 12:08:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11037405] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:08:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296883415] [2024-02-20 12:08:00,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 12:08:00,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:08:00,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:08:00,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:08:00,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-20 12:08:00,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-20 12:08:00,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:08:00,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 34 conjunts are in the unsatisfiable core [2024-02-20 12:08:00,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:08:01,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:08:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-02-20 12:08:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:08:01,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:08:01,701 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-02-20 12:08:01,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-02-20 12:08:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-20 12:08:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296883415] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:08:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:08:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17, 11] total 34 [2024-02-20 12:08:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147472452] [2024-02-20 12:08:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:08:01,995 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 12:08:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:08:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 12:08:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2024-02-20 12:08:02,042 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-02-20 12:08:02,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 1113 transitions, 29385 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-20 12:08:02,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:08:02,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-02-20 12:08:02,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:08:07,089 INFO L124 PetriNetUnfolderBase]: 10950/18678 cut-off events. [2024-02-20 12:08:07,089 INFO L125 PetriNetUnfolderBase]: For 267942/267992 co-relation queries the response was YES. [2024-02-20 12:08:07,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204181 conditions, 18678 events. 10950/18678 cut-off events. For 267942/267992 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 132348 event pairs, 2264 based on Foata normal form. 113/17330 useless extension candidates. Maximal degree in co-relation 81362. Up to 13910 conditions per place. [2024-02-20 12:08:07,264 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 269 selfloop transitions, 16 changer transitions 1203/1497 dead transitions. [2024-02-20 12:08:07,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 1497 transitions, 42450 flow [2024-02-20 12:08:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-20 12:08:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-20 12:08:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-02-20 12:08:07,281 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-02-20 12:08:07,281 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 58 predicate places. [2024-02-20 12:08:07,281 INFO L507 AbstractCegarLoop]: Abstraction has has 106 places, 1497 transitions, 42450 flow [2024-02-20 12:08:07,282 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-20 12:08:07,282 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:08:07,282 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:08:07,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-20 12:08:07,482 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:08:07,483 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-20 12:08:07,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:08:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 396889273, now seen corresponding path program 4 times [2024-02-20 12:08:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:08:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940482375] [2024-02-20 12:08:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:08:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:08:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940482375] [2024-02-20 12:08:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940482375] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:08:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871062743] [2024-02-20 12:08:08,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 12:08:08,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:08:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:08:08,852 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:08:08,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-20 12:08:09,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 12:08:09,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:08:09,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 32 conjunts are in the unsatisfiable core [2024-02-20 12:08:09,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:08:09,515 INFO L349 Elim1Store]: treesize reduction 28, result has 46.2 percent of original size [2024-02-20 12:08:09,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 33 [2024-02-20 12:08:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:08:09,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:08:09,900 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-02-20 12:08:09,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-02-20 12:08:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 12:08:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871062743] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:08:10,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:08:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 36 [2024-02-20 12:08:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540906564] [2024-02-20 12:08:10,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:08:10,275 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-02-20 12:08:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:08:10,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-02-20 12:08:10,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2024-02-20 12:08:10,516 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2024-02-20 12:08:10,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 1497 transitions, 42450 flow. Second operand has 36 states, 36 states have (on average 11.88888888888889) internal successors, (428), 36 states have internal predecessors, (428), 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-20 12:08:10,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:08:10,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2024-02-20 12:08:10,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:08:19,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:08:55,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:08:59,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:09:07,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:09:09,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:09:18,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:09:34,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:09:39,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:11:05,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-02-20 12:11:27,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-20 12:11:31,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-20 12:11:35,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-20 12:16:18,425 INFO L124 PetriNetUnfolderBase]: 81964/133208 cut-off events. [2024-02-20 12:16:18,425 INFO L125 PetriNetUnfolderBase]: For 2079386/2079386 co-relation queries the response was YES. [2024-02-20 12:16:18,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519639 conditions, 133208 events. 81964/133208 cut-off events. For 2079386/2079386 co-relation queries the response was YES. Maximal size of possible extension queue 2049. Compared 1105155 event pairs, 3440 based on Foata normal form. 0/123039 useless extension candidates. Maximal degree in co-relation 926816. Up to 94770 conditions per place. [2024-02-20 12:16:20,447 INFO L140 encePairwiseOnDemand]: 32/50 looper letters, 4537 selfloop transitions, 781 changer transitions 3077/8401 dead transitions. [2024-02-20 12:16:20,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 8401 transitions, 247440 flow [2024-02-20 12:16:20,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2024-02-20 12:16:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2024-02-20 12:16:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 3961 transitions. [2024-02-20 12:16:20,455 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41046632124352334 [2024-02-20 12:16:20,456 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 250 predicate places. [2024-02-20 12:16:20,456 INFO L507 AbstractCegarLoop]: Abstraction has has 298 places, 8401 transitions, 247440 flow [2024-02-20 12:16:20,456 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.88888888888889) internal successors, (428), 36 states have internal predecessors, (428), 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-20 12:16:20,456 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:16:20,457 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:16:20,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-20 12:16:20,662 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-20 12:16:20,663 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-20 12:16:20,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:16:20,663 INFO L85 PathProgramCache]: Analyzing trace with hash -175569683, now seen corresponding path program 5 times [2024-02-20 12:16:20,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:16:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134882192] [2024-02-20 12:16:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:16:20,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:16:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:16:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:16:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:16:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134882192] [2024-02-20 12:16:21,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134882192] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:16:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810170897] [2024-02-20 12:16:21,835 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 12:16:21,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:16:21,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:16:21,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:16:21,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-20 12:16:22,043 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:16:22,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:16:22,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 36 conjunts are in the unsatisfiable core [2024-02-20 12:16:22,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:16:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:16:22,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:16:23,508 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-02-20 12:16:23,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-02-20 12:16:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-20 12:16:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810170897] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:16:23,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:16:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 38 [2024-02-20 12:16:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829152638] [2024-02-20 12:16:23,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:16:23,934 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-02-20 12:16:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:16:23,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-02-20 12:16:23,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2024-02-20 12:16:24,222 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2024-02-20 12:16:24,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 8401 transitions, 247440 flow. Second operand has 38 states, 38 states have (on average 11.868421052631579) internal successors, (451), 38 states have internal predecessors, (451), 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-20 12:16:24,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:16:24,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2024-02-20 12:16:24,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15