./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.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/chl-chromosome-opt-symm.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 e9065224c0b163ad014fc0aee4009feab43ed37ef70e06d8d8f3b14d045f755a --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 11:41:41,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:41:41,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:41:41,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:41:41,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:41:41,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:41:41,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:41:41,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:41:41,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:41:41,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:41:41,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:41:41,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:41:41,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:41:41,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:41:41,253 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:41:41,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:41:41,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:41:41,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:41:41,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:41:41,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:41:41,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:41:41,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:41:41,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:41:41,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:41:41,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:41:41,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:41:41,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:41:41,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:41:41,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:41:41,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:41:41,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:41:41,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:41:41,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:41:41,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:41:41,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:41:41,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:41:41,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:41:41,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:41:41,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:41:41,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:41:41,259 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:41:41,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:41:41,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:41:41,260 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 -> e9065224c0b163ad014fc0aee4009feab43ed37ef70e06d8d8f3b14d045f755a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:41:41,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:41:41,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:41:41,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:41:41,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:41:41,479 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:41:41,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2024-02-20 11:41:42,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:41:42,670 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:41:42,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2024-02-20 11:41:42,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82cd788b/34fb94640a4547c69c4c872d010d119f/FLAGd4d4976bd [2024-02-20 11:41:42,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82cd788b/34fb94640a4547c69c4c872d010d119f [2024-02-20 11:41:42,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:41:42,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:41:42,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:41:42,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:41:42,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:41:42,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:42,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac2dc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42, skipping insertion in model container [2024-02-20 11:41:42,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:42,788 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:41:42,904 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2024-02-20 11:41:42,917 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:41:42,924 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:41:42,938 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2024-02-20 11:41:42,941 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:41:42,952 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:41:42,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42 WrapperNode [2024-02-20 11:41:42,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:41:42,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:41:42,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:41:42,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:41:42,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:42,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:42,987 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 179 [2024-02-20 11:41:42,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:41:42,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:41:42,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:41:42,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:41:42,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:42,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:42,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:43,009 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 2, 10, 2]. 63 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 2, 1]. [2024-02-20 11:41:43,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:43,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:43,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:43,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:43,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:43,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:43,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:41:43,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:41:43,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:41:43,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:41:43,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (1/1) ... [2024-02-20 11:41:43,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:41:43,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:41:43,048 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 11:41:43,065 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 11:41:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:41:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:41:43,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:41:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:41:43,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:41:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:41:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:41:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:41:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 11:41:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:41:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:41:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:41:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:41:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 11:41:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 11:41:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:41:43,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:41:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:41:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:41:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:41:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 11:41:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:41:43,088 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 11:41:43,162 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:41:43,163 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:41:43,370 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:41:43,370 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:41:43,563 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:41:43,564 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-20 11:41:43,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:41:43 BoogieIcfgContainer [2024-02-20 11:41:43,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:41:43,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:41:43,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:41:43,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:41:43,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:41:42" (1/3) ... [2024-02-20 11:41:43,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4059e6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:41:43, skipping insertion in model container [2024-02-20 11:41:43,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:41:42" (2/3) ... [2024-02-20 11:41:43,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4059e6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:41:43, skipping insertion in model container [2024-02-20 11:41:43,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:41:43" (3/3) ... [2024-02-20 11:41:43,573 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2024-02-20 11:41:43,592 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:41:43,593 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:41:43,593 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:41:43,670 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 11:41:43,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 29 transitions, 72 flow [2024-02-20 11:41:43,768 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2024-02-20 11:41:43,768 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:41:43,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 6/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2024-02-20 11:41:43,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 29 transitions, 72 flow [2024-02-20 11:41:43,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 26 transitions, 64 flow [2024-02-20 11:41:43,793 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:41:43,800 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;@1610b9a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:41:43,800 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:41:43,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:41:43,811 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2024-02-20 11:41:43,812 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:41:43,812 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:43,812 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:43,813 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:43,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1508976957, now seen corresponding path program 1 times [2024-02-20 11:41:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:43,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605990602] [2024-02-20 11:41:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:43,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:44,135 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 11:41:44,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:44,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605990602] [2024-02-20 11:41:44,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605990602] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:44,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:44,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:41:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901073728] [2024-02-20 11:41:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:44,146 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:41:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:44,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:41:44,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:41:44,176 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:44,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 11:41:44,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:44,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:44,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:44,393 INFO L124 PetriNetUnfolderBase]: 232/386 cut-off events. [2024-02-20 11:41:44,393 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-02-20 11:41:44,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 386 events. 232/386 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1260 event pairs, 72 based on Foata normal form. 4/292 useless extension candidates. Maximal degree in co-relation 660. Up to 194 conditions per place. [2024-02-20 11:41:44,401 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-02-20 11:41:44,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 53 transitions, 234 flow [2024-02-20 11:41:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:41:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:41:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2024-02-20 11:41:44,413 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4689655172413793 [2024-02-20 11:41:44,416 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2024-02-20 11:41:44,417 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 53 transitions, 234 flow [2024-02-20 11:41:44,418 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 11:41:44,418 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:44,418 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:44,418 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:41:44,418 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:44,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash -811729419, now seen corresponding path program 2 times [2024-02-20 11:41:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935431555] [2024-02-20 11:41:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:44,555 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 11:41:44,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:44,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935431555] [2024-02-20 11:41:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935431555] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:41:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713368238] [2024-02-20 11:41:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:44,558 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:41:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:41:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:41:44,560 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:44,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 53 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 11:41:44,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:44,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:44,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:44,744 INFO L124 PetriNetUnfolderBase]: 496/856 cut-off events. [2024-02-20 11:41:44,745 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-02-20 11:41:44,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 856 events. 496/856 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3909 event pairs, 72 based on Foata normal form. 6/652 useless extension candidates. Maximal degree in co-relation 2083. Up to 428 conditions per place. [2024-02-20 11:41:44,754 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 115 selfloop transitions, 10 changer transitions 2/128 dead transitions. [2024-02-20 11:41:44,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 128 transitions, 830 flow [2024-02-20 11:41:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:41:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:41:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-02-20 11:41:44,756 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2024-02-20 11:41:44,757 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2024-02-20 11:41:44,757 INFO L507 AbstractCegarLoop]: Abstraction has has 35 places, 128 transitions, 830 flow [2024-02-20 11:41:44,757 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 11:41:44,757 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:44,757 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:44,758 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:41:44,758 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:44,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash 465704395, now seen corresponding path program 3 times [2024-02-20 11:41:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462289456] [2024-02-20 11:41:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:44,808 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 11:41:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462289456] [2024-02-20 11:41:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462289456] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:44,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:44,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:41:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621930874] [2024-02-20 11:41:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:44,809 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:41:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:41:44,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:41:44,810 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:44,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 128 transitions, 830 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 11:41:44,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:44,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:44,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:44,932 INFO L124 PetriNetUnfolderBase]: 648/1121 cut-off events. [2024-02-20 11:41:44,932 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2024-02-20 11:41:44,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4535 conditions, 1121 events. 648/1121 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5349 event pairs, 76 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 4177. Up to 835 conditions per place. [2024-02-20 11:41:44,939 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 163 selfloop transitions, 8 changer transitions 5/177 dead transitions. [2024-02-20 11:41:44,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 177 transitions, 1497 flow [2024-02-20 11:41:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:41:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:41:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-02-20 11:41:44,941 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-02-20 11:41:44,941 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2024-02-20 11:41:44,941 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 177 transitions, 1497 flow [2024-02-20 11:41:44,942 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 11:41:44,942 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:44,942 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:44,942 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:41:44,942 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:44,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash 437207255, now seen corresponding path program 4 times [2024-02-20 11:41:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:44,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104203347] [2024-02-20 11:41:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:44,994 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 11:41:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104203347] [2024-02-20 11:41:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104203347] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:41:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99919720] [2024-02-20 11:41:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:44,996 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:41:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:45,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:41:45,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:41:45,013 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:45,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 177 transitions, 1497 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 11:41:45,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:45,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:45,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:45,207 INFO L124 PetriNetUnfolderBase]: 666/1140 cut-off events. [2024-02-20 11:41:45,207 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-02-20 11:41:45,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 1140 events. 666/1140 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5315 event pairs, 88 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 5318. Up to 855 conditions per place. [2024-02-20 11:41:45,214 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 161 selfloop transitions, 9 changer transitions 10/181 dead transitions. [2024-02-20 11:41:45,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 181 transitions, 1889 flow [2024-02-20 11:41:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:41:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:41:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2024-02-20 11:41:45,216 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-02-20 11:41:45,218 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 14 predicate places. [2024-02-20 11:41:45,218 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 181 transitions, 1889 flow [2024-02-20 11:41:45,218 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 11:41:45,218 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:45,218 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:45,218 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:41:45,219 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:45,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash -370092555, now seen corresponding path program 1 times [2024-02-20 11:41:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:45,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552091078] [2024-02-20 11:41:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:45,279 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 11:41:45,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:45,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552091078] [2024-02-20 11:41:45,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552091078] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:45,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:45,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:41:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557969418] [2024-02-20 11:41:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:45,281 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:41:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:45,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:41:45,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:41:45,283 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:45,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 181 transitions, 1889 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 11:41:45,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:45,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:45,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:45,412 INFO L124 PetriNetUnfolderBase]: 596/1016 cut-off events. [2024-02-20 11:41:45,412 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-02-20 11:41:45,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 1016 events. 596/1016 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4565 event pairs, 64 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 5657. Up to 785 conditions per place. [2024-02-20 11:41:45,418 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 147 selfloop transitions, 14 changer transitions 10/172 dead transitions. [2024-02-20 11:41:45,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 172 transitions, 2129 flow [2024-02-20 11:41:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:41:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:41:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-02-20 11:41:45,419 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5948275862068966 [2024-02-20 11:41:45,420 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 17 predicate places. [2024-02-20 11:41:45,420 INFO L507 AbstractCegarLoop]: Abstraction has has 44 places, 172 transitions, 2129 flow [2024-02-20 11:41:45,420 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 11:41:45,420 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:45,420 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:45,421 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:41:45,421 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:45,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1467153361, now seen corresponding path program 1 times [2024-02-20 11:41:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:45,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492409812] [2024-02-20 11:41:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:45,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:45,461 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 11:41:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492409812] [2024-02-20 11:41:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492409812] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:45,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:45,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:41:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827686142] [2024-02-20 11:41:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:45,462 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:41:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:45,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:41:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:41:45,463 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:45,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 172 transitions, 2129 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 11:41:45,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:45,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:45,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:45,583 INFO L124 PetriNetUnfolderBase]: 536/910 cut-off events. [2024-02-20 11:41:45,583 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-02-20 11:41:45,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6399 conditions, 910 events. 536/910 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3918 event pairs, 68 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 5890. Up to 681 conditions per place. [2024-02-20 11:41:45,589 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 137 selfloop transitions, 13 changer transitions 10/161 dead transitions. [2024-02-20 11:41:45,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 161 transitions, 2311 flow [2024-02-20 11:41:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:41:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:41:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-20 11:41:45,590 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2024-02-20 11:41:45,591 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2024-02-20 11:41:45,591 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 161 transitions, 2311 flow [2024-02-20 11:41:45,591 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 11:41:45,591 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:45,591 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] [2024-02-20 11:41:45,591 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:41:45,592 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:45,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash -145314573, now seen corresponding path program 1 times [2024-02-20 11:41:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:45,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741063145] [2024-02-20 11:41:45,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:45,632 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 11:41:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741063145] [2024-02-20 11:41:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741063145] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:45,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:45,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 11:41:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896574637] [2024-02-20 11:41:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:45,633 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:41:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:41:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:41:45,634 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:45,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 161 transitions, 2311 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 11:41:45,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:45,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:45,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:45,721 INFO L124 PetriNetUnfolderBase]: 536/912 cut-off events. [2024-02-20 11:41:45,722 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-02-20 11:41:45,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 912 events. 536/912 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3907 event pairs, 68 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 6727. Up to 904 conditions per place. [2024-02-20 11:41:45,727 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 148 selfloop transitions, 4 changer transitions 10/163 dead transitions. [2024-02-20 11:41:45,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 163 transitions, 2663 flow [2024-02-20 11:41:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:41:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:41:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2024-02-20 11:41:45,729 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4367816091954023 [2024-02-20 11:41:45,729 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2024-02-20 11:41:45,729 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 163 transitions, 2663 flow [2024-02-20 11:41:45,729 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 11:41:45,729 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:45,730 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] [2024-02-20 11:41:45,730 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:41:45,730 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:45,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1126593258, now seen corresponding path program 1 times [2024-02-20 11:41:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:45,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558390644] [2024-02-20 11:41:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 11:41:45,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558390644] [2024-02-20 11:41:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558390644] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:41:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960499847] [2024-02-20 11:41:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:45,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:41:45,781 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 11:41:45,793 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 11:41:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:45,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 11:41:45,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:41:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 11:41:45,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:41:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 11:41:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960499847] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:41:45,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:41:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-02-20 11:41:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289360125] [2024-02-20 11:41:45,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:41:45,951 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:41:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:45,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:41:45,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-20 11:41:45,952 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:45,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 163 transitions, 2663 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 11:41:45,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:45,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:45,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:46,082 INFO L124 PetriNetUnfolderBase]: 536/918 cut-off events. [2024-02-20 11:41:46,083 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-02-20 11:41:46,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8279 conditions, 918 events. 536/918 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3938 event pairs, 64 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 7564. Up to 910 conditions per place. [2024-02-20 11:41:46,089 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 148 selfloop transitions, 10 changer transitions 10/169 dead transitions. [2024-02-20 11:41:46,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 169 transitions, 3095 flow [2024-02-20 11:41:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 11:41:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 11:41:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2024-02-20 11:41:46,090 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3275862068965517 [2024-02-20 11:41:46,091 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 27 predicate places. [2024-02-20 11:41:46,091 INFO L507 AbstractCegarLoop]: Abstraction has has 54 places, 169 transitions, 3095 flow [2024-02-20 11:41:46,091 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 11:41:46,091 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:46,091 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:46,103 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 11:41:46,302 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:46,303 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:46,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:46,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1535137971, now seen corresponding path program 2 times [2024-02-20 11:41:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423860679] [2024-02-20 11:41:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-20 11:41:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423860679] [2024-02-20 11:41:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423860679] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:41:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064907948] [2024-02-20 11:41:46,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:41:46,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:46,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:41:46,407 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 11:41:46,408 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 11:41:46,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-20 11:41:46,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:41:46,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-20 11:41:46,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:41:46,686 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-02-20 11:41:46,687 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 103 treesize of output 64 [2024-02-20 11:41:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-02-20 11:41:46,758 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:41:46,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064907948] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:46,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:41:46,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 13 [2024-02-20 11:41:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517485053] [2024-02-20 11:41:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:46,759 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:41:46,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:41:46,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:41:46,760 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:46,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 169 transitions, 3095 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 11:41:46,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:46,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:46,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:47,204 INFO L124 PetriNetUnfolderBase]: 711/1237 cut-off events. [2024-02-20 11:41:47,204 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-02-20 11:41:47,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12381 conditions, 1237 events. 711/1237 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5903 event pairs, 44 based on Foata normal form. 1/972 useless extension candidates. Maximal degree in co-relation 11388. Up to 1226 conditions per place. [2024-02-20 11:41:47,216 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 215 selfloop transitions, 24 changer transitions 29/269 dead transitions. [2024-02-20 11:41:47,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 269 transitions, 5470 flow [2024-02-20 11:41:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-20 11:41:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-20 11:41:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-02-20 11:41:47,218 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4789272030651341 [2024-02-20 11:41:47,218 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 35 predicate places. [2024-02-20 11:41:47,219 INFO L507 AbstractCegarLoop]: Abstraction has has 62 places, 269 transitions, 5470 flow [2024-02-20 11:41:47,219 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 11:41:47,219 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:47,219 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:47,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-20 11:41:47,430 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,SelfDestructingSolverStorable8 [2024-02-20 11:41:47,431 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:47,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1457353651, now seen corresponding path program 3 times [2024-02-20 11:41:47,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852210789] [2024-02-20 11:41:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-20 11:41:47,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:47,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852210789] [2024-02-20 11:41:47,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852210789] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:41:47,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242322115] [2024-02-20 11:41:47,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:41:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:47,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:41:47,530 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 11:41:47,531 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 11:41:47,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-20 11:41:47,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:41:47,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-20 11:41:47,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:41:47,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 11:41:47,733 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 118 treesize of output 74 [2024-02-20 11:41:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-02-20 11:41:47,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:41:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242322115] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:41:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 13 [2024-02-20 11:41:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318621207] [2024-02-20 11:41:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:47,834 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:41:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:47,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:41:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:41:47,835 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:47,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 269 transitions, 5470 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 11:41:47,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:47,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:47,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:48,459 INFO L124 PetriNetUnfolderBase]: 867/1530 cut-off events. [2024-02-20 11:41:48,460 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2024-02-20 11:41:48,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16813 conditions, 1530 events. 867/1530 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7935 event pairs, 40 based on Foata normal form. 1/1209 useless extension candidates. Maximal degree in co-relation 15618. Up to 1515 conditions per place. [2024-02-20 11:41:48,472 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 276 selfloop transitions, 39 changer transitions 39/355 dead transitions. [2024-02-20 11:41:48,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 355 transitions, 7940 flow [2024-02-20 11:41:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 11:41:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 11:41:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 190 transitions. [2024-02-20 11:41:48,474 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46798029556650245 [2024-02-20 11:41:48,475 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2024-02-20 11:41:48,475 INFO L507 AbstractCegarLoop]: Abstraction has has 75 places, 355 transitions, 7940 flow [2024-02-20 11:41:48,475 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 11:41:48,475 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:48,475 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:48,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-20 11:41:48,686 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:48,687 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:48,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:48,687 INFO L85 PathProgramCache]: Analyzing trace with hash 91638259, now seen corresponding path program 4 times [2024-02-20 11:41:48,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:48,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585337604] [2024-02-20 11:41:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:48,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-20 11:41:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585337604] [2024-02-20 11:41:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585337604] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:41:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782020113] [2024-02-20 11:41:48,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 11:41:48,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:48,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:41:48,793 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 11:41:48,794 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 11:41:48,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 11:41:48,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:41:48,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-20 11:41:48,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:41:48,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 11:41:48,953 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 118 treesize of output 74 [2024-02-20 11:41:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-02-20 11:41:49,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:41:49,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782020113] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:49,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:41:49,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 13 [2024-02-20 11:41:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831715679] [2024-02-20 11:41:49,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:49,050 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:41:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:49,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:41:49,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:41:49,051 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:49,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 355 transitions, 7940 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 11:41:49,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:49,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:49,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:49,695 INFO L124 PetriNetUnfolderBase]: 897/1600 cut-off events. [2024-02-20 11:41:49,695 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2024-02-20 11:41:49,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19167 conditions, 1600 events. 897/1600 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8502 event pairs, 44 based on Foata normal form. 1/1273 useless extension candidates. Maximal degree in co-relation 17830. Up to 1584 conditions per place. [2024-02-20 11:41:49,707 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 284 selfloop transitions, 39 changer transitions 51/375 dead transitions. [2024-02-20 11:41:49,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 375 transitions, 9143 flow [2024-02-20 11:41:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 11:41:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 11:41:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 195 transitions. [2024-02-20 11:41:49,709 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4802955665024631 [2024-02-20 11:41:49,709 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 61 predicate places. [2024-02-20 11:41:49,709 INFO L507 AbstractCegarLoop]: Abstraction has has 88 places, 375 transitions, 9143 flow [2024-02-20 11:41:49,709 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 11:41:49,709 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:49,710 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:49,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-20 11:41:49,919 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:49,920 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:49,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash -987322707, now seen corresponding path program 5 times [2024-02-20 11:41:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:49,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102367359] [2024-02-20 11:41:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-20 11:41:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102367359] [2024-02-20 11:41:50,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102367359] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:41:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065983166] [2024-02-20 11:41:50,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 11:41:50,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:50,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:41:50,061 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 11:41:50,101 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 11:41:50,187 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-20 11:41:50,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:41:50,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 11:41:50,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:41:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-20 11:41:50,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:41:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-02-20 11:41:50,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065983166] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:41:50,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:41:50,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-02-20 11:41:50,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032332111] [2024-02-20 11:41:50,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:41:50,261 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-20 11:41:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:50,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-20 11:41:50,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:41:50,262 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:50,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 375 transitions, 9143 flow. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 11:41:50,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:50,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:50,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:50,494 INFO L124 PetriNetUnfolderBase]: 897/1602 cut-off events. [2024-02-20 11:41:50,495 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-02-20 11:41:50,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20779 conditions, 1602 events. 897/1602 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8499 event pairs, 40 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 19310. Up to 1586 conditions per place. [2024-02-20 11:41:50,510 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 313 selfloop transitions, 12 changer transitions 51/377 dead transitions. [2024-02-20 11:41:50,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 377 transitions, 9943 flow [2024-02-20 11:41:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-20 11:41:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-20 11:41:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2024-02-20 11:41:50,511 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2024-02-20 11:41:50,512 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 67 predicate places. [2024-02-20 11:41:50,512 INFO L507 AbstractCegarLoop]: Abstraction has has 94 places, 377 transitions, 9943 flow [2024-02-20 11:41:50,512 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 11:41:50,512 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:50,512 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:50,527 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 11:41:50,724 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,SelfDestructingSolverStorable11 [2024-02-20 11:41:50,724 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:50,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1574395216, now seen corresponding path program 6 times [2024-02-20 11:41:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432779596] [2024-02-20 11:41:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:41:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:51,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432779596] [2024-02-20 11:41:51,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432779596] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:51,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:51,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:41:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833921861] [2024-02-20 11:41:51,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:51,283 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:41:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:51,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:41:51,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:41:51,284 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:51,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 377 transitions, 9943 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:51,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:51,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:51,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:52,133 INFO L124 PetriNetUnfolderBase]: 1083/1951 cut-off events. [2024-02-20 11:41:52,134 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2024-02-20 11:41:52,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27269 conditions, 1951 events. 1083/1951 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10992 event pairs, 6 based on Foata normal form. 4/1565 useless extension candidates. Maximal degree in co-relation 25514. Up to 1934 conditions per place. [2024-02-20 11:41:52,150 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 339 selfloop transitions, 115 changer transitions 61/516 dead transitions. [2024-02-20 11:41:52,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 516 transitions, 14641 flow [2024-02-20 11:41:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-02-20 11:41:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-02-20 11:41:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 283 transitions. [2024-02-20 11:41:52,152 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40660919540229884 [2024-02-20 11:41:52,152 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 90 predicate places. [2024-02-20 11:41:52,152 INFO L507 AbstractCegarLoop]: Abstraction has has 117 places, 516 transitions, 14641 flow [2024-02-20 11:41:52,153 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:52,153 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:52,153 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:52,153 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-20 11:41:52,153 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:52,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash 688596936, now seen corresponding path program 7 times [2024-02-20 11:41:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:52,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497799225] [2024-02-20 11:41:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:41:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:52,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497799225] [2024-02-20 11:41:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497799225] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:41:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444250329] [2024-02-20 11:41:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:52,673 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:41:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:41:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:41:52,675 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:52,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 516 transitions, 14641 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:52,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:52,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:52,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:53,416 INFO L124 PetriNetUnfolderBase]: 1101/1988 cut-off events. [2024-02-20 11:41:53,416 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-02-20 11:41:53,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29764 conditions, 1988 events. 1101/1988 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11338 event pairs, 22 based on Foata normal form. 1/1593 useless extension candidates. Maximal degree in co-relation 27873. Up to 1971 conditions per place. [2024-02-20 11:41:53,437 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 360 selfloop transitions, 99 changer transitions 68/528 dead transitions. [2024-02-20 11:41:53,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 528 transitions, 16040 flow [2024-02-20 11:41:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-20 11:41:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-20 11:41:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 240 transitions. [2024-02-20 11:41:53,439 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2024-02-20 11:41:53,440 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 109 predicate places. [2024-02-20 11:41:53,440 INFO L507 AbstractCegarLoop]: Abstraction has has 136 places, 528 transitions, 16040 flow [2024-02-20 11:41:53,440 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:53,440 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:53,441 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:53,441 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-20 11:41:53,441 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:53,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 787401720, now seen corresponding path program 8 times [2024-02-20 11:41:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481297458] [2024-02-20 11:41:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:41:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481297458] [2024-02-20 11:41:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481297458] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:41:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591598009] [2024-02-20 11:41:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:54,049 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:41:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:41:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:41:54,049 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:54,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 528 transitions, 16040 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:54,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:54,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:54,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:55,281 INFO L124 PetriNetUnfolderBase]: 1625/2950 cut-off events. [2024-02-20 11:41:55,282 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2024-02-20 11:41:55,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47016 conditions, 2950 events. 1625/2950 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18466 event pairs, 30 based on Foata normal form. 1/2351 useless extension candidates. Maximal degree in co-relation 43918. Up to 2921 conditions per place. [2024-02-20 11:41:55,315 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 558 selfloop transitions, 136 changer transitions 78/773 dead transitions. [2024-02-20 11:41:55,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 773 transitions, 25060 flow [2024-02-20 11:41:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-20 11:41:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-20 11:41:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 247 transitions. [2024-02-20 11:41:55,317 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40558292282430214 [2024-02-20 11:41:55,318 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 129 predicate places. [2024-02-20 11:41:55,318 INFO L507 AbstractCegarLoop]: Abstraction has has 156 places, 773 transitions, 25060 flow [2024-02-20 11:41:55,318 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:55,318 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:55,318 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:55,318 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-20 11:41:55,319 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:55,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 225091324, now seen corresponding path program 9 times [2024-02-20 11:41:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:55,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805988082] [2024-02-20 11:41:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:41:55,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:55,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805988082] [2024-02-20 11:41:55,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805988082] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:55,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:55,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:41:55,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688746660] [2024-02-20 11:41:55,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:55,954 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:41:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:55,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:41:55,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:41:55,955 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:55,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 773 transitions, 25060 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:55,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:55,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:55,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:57,027 INFO L124 PetriNetUnfolderBase]: 1723/3179 cut-off events. [2024-02-20 11:41:57,027 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-02-20 11:41:57,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53757 conditions, 3179 events. 1723/3179 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 20585 event pairs, 22 based on Foata normal form. 1/2552 useless extension candidates. Maximal degree in co-relation 50238. Up to 3144 conditions per place. [2024-02-20 11:41:57,061 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 638 selfloop transitions, 137 changer transitions 85/861 dead transitions. [2024-02-20 11:41:57,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 861 transitions, 29644 flow [2024-02-20 11:41:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-20 11:41:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-20 11:41:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 207 transitions. [2024-02-20 11:41:57,063 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2024-02-20 11:41:57,063 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 146 predicate places. [2024-02-20 11:41:57,063 INFO L507 AbstractCegarLoop]: Abstraction has has 173 places, 861 transitions, 29644 flow [2024-02-20 11:41:57,063 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:57,063 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:57,063 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:57,064 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-20 11:41:57,064 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:57,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash -573948680, now seen corresponding path program 10 times [2024-02-20 11:41:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954910666] [2024-02-20 11:41:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:41:57,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:57,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954910666] [2024-02-20 11:41:57,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954910666] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:57,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:57,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:41:57,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847649209] [2024-02-20 11:41:57,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:57,603 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:41:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:41:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:41:57,605 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:57,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 861 transitions, 29644 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:57,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:57,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:57,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:59,252 INFO L124 PetriNetUnfolderBase]: 1870/3449 cut-off events. [2024-02-20 11:41:59,253 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2024-02-20 11:41:59,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61748 conditions, 3449 events. 1870/3449 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 22672 event pairs, 18 based on Foata normal form. 1/2764 useless extension candidates. Maximal degree in co-relation 57896. Up to 3412 conditions per place. [2024-02-20 11:41:59,289 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 638 selfloop transitions, 189 changer transitions 94/922 dead transitions. [2024-02-20 11:41:59,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 922 transitions, 33590 flow [2024-02-20 11:41:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-20 11:41:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-20 11:41:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 274 transitions. [2024-02-20 11:41:59,294 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4107946026986507 [2024-02-20 11:41:59,295 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 168 predicate places. [2024-02-20 11:41:59,295 INFO L507 AbstractCegarLoop]: Abstraction has has 195 places, 922 transitions, 33590 flow [2024-02-20 11:41:59,295 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:59,295 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:59,295 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:59,296 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-20 11:41:59,296 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:59,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1767557902, now seen corresponding path program 11 times [2024-02-20 11:41:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134101882] [2024-02-20 11:41:59,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:41:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134101882] [2024-02-20 11:41:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134101882] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:41:59,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:41:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:41:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655779098] [2024-02-20 11:41:59,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:41:59,770 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:41:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:59,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:41:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:41:59,771 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:41:59,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 922 transitions, 33590 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:41:59,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:59,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:41:59,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:01,370 INFO L124 PetriNetUnfolderBase]: 2139/3952 cut-off events. [2024-02-20 11:42:01,371 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2024-02-20 11:42:01,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74665 conditions, 3952 events. 2139/3952 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 26769 event pairs, 18 based on Foata normal form. 4/3162 useless extension candidates. Maximal degree in co-relation 70306. Up to 3910 conditions per place. [2024-02-20 11:42:01,409 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 750 selfloop transitions, 186 changer transitions 117/1054 dead transitions. [2024-02-20 11:42:01,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1054 transitions, 40514 flow [2024-02-20 11:42:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-02-20 11:42:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-02-20 11:42:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 349 transitions. [2024-02-20 11:42:01,411 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42980295566502463 [2024-02-20 11:42:01,411 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 195 predicate places. [2024-02-20 11:42:01,412 INFO L507 AbstractCegarLoop]: Abstraction has has 222 places, 1054 transitions, 40514 flow [2024-02-20 11:42:01,412 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:01,412 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:01,412 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:01,412 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-20 11:42:01,412 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:01,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1161694002, now seen corresponding path program 12 times [2024-02-20 11:42:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379015604] [2024-02-20 11:42:01,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:01,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:01,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379015604] [2024-02-20 11:42:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379015604] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:01,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:01,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:01,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374067913] [2024-02-20 11:42:01,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:01,831 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:01,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:01,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:01,832 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:01,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1054 transitions, 40514 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:01,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:01,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:01,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:03,465 INFO L124 PetriNetUnfolderBase]: 2139/3950 cut-off events. [2024-02-20 11:42:03,465 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2024-02-20 11:42:03,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78556 conditions, 3950 events. 2139/3950 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 26813 event pairs, 18 based on Foata normal form. 1/3157 useless extension candidates. Maximal degree in co-relation 73996. Up to 3909 conditions per place. [2024-02-20 11:42:03,506 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 702 selfloop transitions, 226 changer transitions 124/1053 dead transitions. [2024-02-20 11:42:03,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1053 transitions, 42580 flow [2024-02-20 11:42:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-02-20 11:42:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-02-20 11:42:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 287 transitions. [2024-02-20 11:42:03,507 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41235632183908044 [2024-02-20 11:42:03,508 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 218 predicate places. [2024-02-20 11:42:03,508 INFO L507 AbstractCegarLoop]: Abstraction has has 245 places, 1053 transitions, 42580 flow [2024-02-20 11:42:03,508 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:03,508 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:03,508 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:03,508 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-20 11:42:03,509 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:03,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1603923478, now seen corresponding path program 13 times [2024-02-20 11:42:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:03,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489055179] [2024-02-20 11:42:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489055179] [2024-02-20 11:42:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489055179] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542926861] [2024-02-20 11:42:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:04,150 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:04,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:04,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:04,151 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:04,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1053 transitions, 42580 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:04,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:04,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:04,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:06,064 INFO L124 PetriNetUnfolderBase]: 2630/4851 cut-off events. [2024-02-20 11:42:06,065 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2024-02-20 11:42:06,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101290 conditions, 4851 events. 2630/4851 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33929 event pairs, 22 based on Foata normal form. 1/3864 useless extension candidates. Maximal degree in co-relation 95981. Up to 4802 conditions per place. [2024-02-20 11:42:06,122 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 990 selfloop transitions, 160 changer transitions 138/1289 dead transitions. [2024-02-20 11:42:06,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1289 transitions, 54713 flow [2024-02-20 11:42:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-20 11:42:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-20 11:42:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 182 transitions. [2024-02-20 11:42:06,124 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3922413793103448 [2024-02-20 11:42:06,124 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 233 predicate places. [2024-02-20 11:42:06,124 INFO L507 AbstractCegarLoop]: Abstraction has has 260 places, 1289 transitions, 54713 flow [2024-02-20 11:42:06,124 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:06,124 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:06,124 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:06,124 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-20 11:42:06,125 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:06,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash 598358938, now seen corresponding path program 14 times [2024-02-20 11:42:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:06,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527021435] [2024-02-20 11:42:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:06,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:06,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527021435] [2024-02-20 11:42:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527021435] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:06,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779558174] [2024-02-20 11:42:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:06,494 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:06,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:06,495 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:06,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 1289 transitions, 54713 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:06,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:06,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:06,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:08,616 INFO L124 PetriNetUnfolderBase]: 2958/5463 cut-off events. [2024-02-20 11:42:08,616 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2024-02-20 11:42:08,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119480 conditions, 5463 events. 2958/5463 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 39373 event pairs, 22 based on Foata normal form. 4/4347 useless extension candidates. Maximal degree in co-relation 113512. Up to 5408 conditions per place. [2024-02-20 11:42:08,677 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 1040 selfloop transitions, 252 changer transitions 156/1449 dead transitions. [2024-02-20 11:42:08,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1449 transitions, 64416 flow [2024-02-20 11:42:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-02-20 11:42:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-02-20 11:42:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 269 transitions. [2024-02-20 11:42:08,678 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4216300940438871 [2024-02-20 11:42:08,679 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 254 predicate places. [2024-02-20 11:42:08,679 INFO L507 AbstractCegarLoop]: Abstraction has has 281 places, 1449 transitions, 64416 flow [2024-02-20 11:42:08,679 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:08,679 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:08,679 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:08,679 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-20 11:42:08,679 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:08,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash -767356454, now seen corresponding path program 15 times [2024-02-20 11:42:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274160350] [2024-02-20 11:42:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:09,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:09,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274160350] [2024-02-20 11:42:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274160350] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223992845] [2024-02-20 11:42:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:09,059 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:09,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:09,059 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:09,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 1449 transitions, 64416 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:09,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:09,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:09,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:11,601 INFO L124 PetriNetUnfolderBase]: 2976/5500 cut-off events. [2024-02-20 11:42:11,601 INFO L125 PetriNetUnfolderBase]: For 659/659 co-relation queries the response was YES. [2024-02-20 11:42:11,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125745 conditions, 5500 events. 2976/5500 cut-off events. For 659/659 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 39708 event pairs, 22 based on Foata normal form. 1/4375 useless extension candidates. Maximal degree in co-relation 119490. Up to 5445 conditions per place. [2024-02-20 11:42:11,670 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 996 selfloop transitions, 301 changer transitions 163/1461 dead transitions. [2024-02-20 11:42:11,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 1461 transitions, 67873 flow [2024-02-20 11:42:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-02-20 11:42:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-02-20 11:42:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 282 transitions. [2024-02-20 11:42:11,671 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4051724137931034 [2024-02-20 11:42:11,672 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 277 predicate places. [2024-02-20 11:42:11,672 INFO L507 AbstractCegarLoop]: Abstraction has has 304 places, 1461 transitions, 67873 flow [2024-02-20 11:42:11,672 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:11,672 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:11,672 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:11,672 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-20 11:42:11,673 INFO L432 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:11,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1783440918, now seen corresponding path program 16 times [2024-02-20 11:42:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:11,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485478021] [2024-02-20 11:42:11,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:12,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485478021] [2024-02-20 11:42:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485478021] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:12,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:12,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251054545] [2024-02-20 11:42:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:12,059 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:12,060 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:12,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 1461 transitions, 67873 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:12,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:12,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:12,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:14,721 INFO L124 PetriNetUnfolderBase]: 3237/6027 cut-off events. [2024-02-20 11:42:14,721 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2024-02-20 11:42:14,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143652 conditions, 6027 events. 3237/6027 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 44761 event pairs, 30 based on Foata normal form. 1/4810 useless extension candidates. Maximal degree in co-relation 136583. Up to 5962 conditions per place. [2024-02-20 11:42:14,793 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 1162 selfloop transitions, 276 changer transitions 171/1610 dead transitions. [2024-02-20 11:42:14,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1610 transitions, 78023 flow [2024-02-20 11:42:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-02-20 11:42:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-02-20 11:42:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 283 transitions. [2024-02-20 11:42:14,795 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3903448275862069 [2024-02-20 11:42:14,795 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 301 predicate places. [2024-02-20 11:42:14,795 INFO L507 AbstractCegarLoop]: Abstraction has has 328 places, 1610 transitions, 78023 flow [2024-02-20 11:42:14,796 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:14,796 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:14,796 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:14,796 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-20 11:42:14,796 INFO L432 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:14,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1985144264, now seen corresponding path program 17 times [2024-02-20 11:42:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48888711] [2024-02-20 11:42:14,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:15,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48888711] [2024-02-20 11:42:15,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48888711] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:15,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:15,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:15,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682487823] [2024-02-20 11:42:15,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:15,191 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:15,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:15,193 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:15,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 1610 transitions, 78023 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:15,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:15,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:15,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:18,723 INFO L124 PetriNetUnfolderBase]: 3251/6058 cut-off events. [2024-02-20 11:42:18,723 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2024-02-20 11:42:18,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150394 conditions, 6058 events. 3251/6058 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 45034 event pairs, 22 based on Foata normal form. 1/4837 useless extension candidates. Maximal degree in co-relation 143013. Up to 5993 conditions per place. [2024-02-20 11:42:18,800 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 1185 selfloop transitions, 256 changer transitions 178/1620 dead transitions. [2024-02-20 11:42:18,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1620 transitions, 81747 flow [2024-02-20 11:42:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-20 11:42:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-20 11:42:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 238 transitions. [2024-02-20 11:42:18,802 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4103448275862069 [2024-02-20 11:42:18,802 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 320 predicate places. [2024-02-20 11:42:18,803 INFO L507 AbstractCegarLoop]: Abstraction has has 347 places, 1620 transitions, 81747 flow [2024-02-20 11:42:18,803 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:18,803 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:18,803 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:18,803 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-20 11:42:18,803 INFO L432 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:18,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1846317420, now seen corresponding path program 18 times [2024-02-20 11:42:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129614319] [2024-02-20 11:42:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:19,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:19,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129614319] [2024-02-20 11:42:19,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129614319] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:19,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:19,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798909852] [2024-02-20 11:42:19,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:19,265 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:19,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:19,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:19,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:19,265 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:19,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 1620 transitions, 81747 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:19,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:19,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:19,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:22,602 INFO L124 PetriNetUnfolderBase]: 3251/6056 cut-off events. [2024-02-20 11:42:22,603 INFO L125 PetriNetUnfolderBase]: For 738/738 co-relation queries the response was YES. [2024-02-20 11:42:22,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156362 conditions, 6056 events. 3251/6056 cut-off events. For 738/738 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 45089 event pairs, 22 based on Foata normal form. 1/4835 useless extension candidates. Maximal degree in co-relation 148721. Up to 5992 conditions per place. [2024-02-20 11:42:22,676 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 1159 selfloop transitions, 274 changer transitions 185/1619 dead transitions. [2024-02-20 11:42:22,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1619 transitions, 84933 flow [2024-02-20 11:42:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-20 11:42:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-20 11:42:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 203 transitions. [2024-02-20 11:42:22,678 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-02-20 11:42:22,678 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 337 predicate places. [2024-02-20 11:42:22,678 INFO L507 AbstractCegarLoop]: Abstraction has has 364 places, 1619 transitions, 84933 flow [2024-02-20 11:42:22,678 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:22,679 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:22,679 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:22,679 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-02-20 11:42:22,679 INFO L432 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:22,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1712486374, now seen corresponding path program 19 times [2024-02-20 11:42:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991526374] [2024-02-20 11:42:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:23,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991526374] [2024-02-20 11:42:23,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991526374] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:23,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:23,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540014662] [2024-02-20 11:42:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:23,171 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:23,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:23,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:23,172 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:23,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1619 transitions, 84933 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:23,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:23,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:23,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:26,479 INFO L124 PetriNetUnfolderBase]: 3251/6054 cut-off events. [2024-02-20 11:42:26,479 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2024-02-20 11:42:26,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162328 conditions, 6054 events. 3251/6054 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 45003 event pairs, 22 based on Foata normal form. 1/4833 useless extension candidates. Maximal degree in co-relation 154429. Up to 5991 conditions per place. [2024-02-20 11:42:26,659 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 1176 selfloop transitions, 249 changer transitions 192/1618 dead transitions. [2024-02-20 11:42:26,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1618 transitions, 88115 flow [2024-02-20 11:42:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-20 11:42:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-20 11:42:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 221 transitions. [2024-02-20 11:42:26,661 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4010889292196007 [2024-02-20 11:42:26,661 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 355 predicate places. [2024-02-20 11:42:26,661 INFO L507 AbstractCegarLoop]: Abstraction has has 382 places, 1618 transitions, 88115 flow [2024-02-20 11:42:26,661 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:26,661 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:26,662 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:26,662 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-02-20 11:42:26,662 INFO L432 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:26,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash 417725526, now seen corresponding path program 20 times [2024-02-20 11:42:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423262113] [2024-02-20 11:42:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:27,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:27,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423262113] [2024-02-20 11:42:27,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423262113] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:27,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:27,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425586610] [2024-02-20 11:42:27,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:27,042 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:27,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:27,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:27,043 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:27,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1618 transitions, 88115 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:27,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:27,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:27,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:30,468 INFO L124 PetriNetUnfolderBase]: 3251/6052 cut-off events. [2024-02-20 11:42:30,469 INFO L125 PetriNetUnfolderBase]: For 728/728 co-relation queries the response was YES. [2024-02-20 11:42:30,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168292 conditions, 6052 events. 3251/6052 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 44982 event pairs, 30 based on Foata normal form. 1/4831 useless extension candidates. Maximal degree in co-relation 160137. Up to 5990 conditions per place. [2024-02-20 11:42:30,541 INFO L140 encePairwiseOnDemand]: 16/29 looper letters, 1110 selfloop transitions, 307 changer transitions 199/1617 dead transitions. [2024-02-20 11:42:30,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1617 transitions, 91293 flow [2024-02-20 11:42:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-02-20 11:42:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-02-20 11:42:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 298 transitions. [2024-02-20 11:42:30,553 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38058748403575987 [2024-02-20 11:42:30,554 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 381 predicate places. [2024-02-20 11:42:30,554 INFO L507 AbstractCegarLoop]: Abstraction has has 408 places, 1617 transitions, 91293 flow [2024-02-20 11:42:30,554 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:30,554 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:30,554 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:30,554 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-02-20 11:42:30,554 INFO L432 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:30,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:30,555 INFO L85 PathProgramCache]: Analyzing trace with hash -179611132, now seen corresponding path program 21 times [2024-02-20 11:42:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:30,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738055298] [2024-02-20 11:42:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:30,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738055298] [2024-02-20 11:42:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738055298] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:30,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:30,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:30,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172594240] [2024-02-20 11:42:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:30,946 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:30,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:30,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:30,947 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:30,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 1617 transitions, 91293 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:30,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:30,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:30,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:34,293 INFO L124 PetriNetUnfolderBase]: 3257/6071 cut-off events. [2024-02-20 11:42:34,294 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2024-02-20 11:42:34,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174838 conditions, 6071 events. 3257/6071 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 45250 event pairs, 22 based on Foata normal form. 1/4850 useless extension candidates. Maximal degree in co-relation 166369. Up to 6009 conditions per place. [2024-02-20 11:42:34,508 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 1086 selfloop transitions, 330 changer transitions 206/1623 dead transitions. [2024-02-20 11:42:34,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1623 transitions, 94879 flow [2024-02-20 11:42:34,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-02-20 11:42:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-02-20 11:42:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 284 transitions. [2024-02-20 11:42:34,511 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40804597701149425 [2024-02-20 11:42:34,516 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 404 predicate places. [2024-02-20 11:42:34,516 INFO L507 AbstractCegarLoop]: Abstraction has has 431 places, 1623 transitions, 94879 flow [2024-02-20 11:42:34,516 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:34,516 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:34,516 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:34,517 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-02-20 11:42:34,517 INFO L432 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:34,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1186104260, now seen corresponding path program 22 times [2024-02-20 11:42:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:34,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567552796] [2024-02-20 11:42:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567552796] [2024-02-20 11:42:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567552796] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:42:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:42:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:42:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244238036] [2024-02-20 11:42:34,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:42:34,931 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:42:34,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:42:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:42:34,935 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:34,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 1623 transitions, 94879 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:34,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:34,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:34,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:38,438 INFO L124 PetriNetUnfolderBase]: 3257/6069 cut-off events. [2024-02-20 11:42:38,438 INFO L125 PetriNetUnfolderBase]: For 743/743 co-relation queries the response was YES. [2024-02-20 11:42:38,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180818 conditions, 6069 events. 3257/6069 cut-off events. For 743/743 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 45204 event pairs, 22 based on Foata normal form. 1/4848 useless extension candidates. Maximal degree in co-relation 172095. Up to 6008 conditions per place. [2024-02-20 11:42:38,510 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 1072 selfloop transitions, 336 changer transitions 213/1622 dead transitions. [2024-02-20 11:42:38,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1622 transitions, 98063 flow [2024-02-20 11:42:38,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-02-20 11:42:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-02-20 11:42:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 301 transitions. [2024-02-20 11:42:38,512 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41517241379310343 [2024-02-20 11:42:38,512 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 428 predicate places. [2024-02-20 11:42:38,513 INFO L507 AbstractCegarLoop]: Abstraction has has 455 places, 1622 transitions, 98063 flow [2024-02-20 11:42:38,513 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 11:42:38,513 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:38,513 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:38,513 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-02-20 11:42:38,513 INFO L432 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:38,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1045450512, now seen corresponding path program 1 times [2024-02-20 11:42:38,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:38,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093969757] [2024-02-20 11:42:38,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:38,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:38,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093969757] [2024-02-20 11:42:38,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093969757] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:42:38,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710636203] [2024-02-20 11:42:38,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:38,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:42:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:42:38,559 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 11:42:38,560 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 11:42:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:38,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-20 11:42:38,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:42:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:38,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:42:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:38,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710636203] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:42:38,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:42:38,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-02-20 11:42:38,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506655164] [2024-02-20 11:42:38,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:42:38,745 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:42:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:42:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:42:38,745 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:38,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 1622 transitions, 98063 flow. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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 11:42:38,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:38,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:38,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:41,770 INFO L124 PetriNetUnfolderBase]: 3597/6623 cut-off events. [2024-02-20 11:42:41,770 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2024-02-20 11:42:41,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203889 conditions, 6623 events. 3597/6623 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 46915 event pairs, 32 based on Foata normal form. 0/5399 useless extension candidates. Maximal degree in co-relation 194475. Up to 6559 conditions per place. [2024-02-20 11:42:41,875 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 1662 selfloop transitions, 138 changer transitions 196/1997 dead transitions. [2024-02-20 11:42:41,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 1997 transitions, 124492 flow [2024-02-20 11:42:41,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-20 11:42:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-20 11:42:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-02-20 11:42:41,876 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6354679802955665 [2024-02-20 11:42:41,876 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 434 predicate places. [2024-02-20 11:42:41,876 INFO L507 AbstractCegarLoop]: Abstraction has has 461 places, 1997 transitions, 124492 flow [2024-02-20 11:42:41,876 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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 11:42:41,877 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:41,877 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:41,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-20 11:42:42,087 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:42:42,087 INFO L432 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:42,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash -41977649, now seen corresponding path program 1 times [2024-02-20 11:42:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:42,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121720255] [2024-02-20 11:42:42,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:42,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:42,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121720255] [2024-02-20 11:42:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121720255] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:42:42,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233721787] [2024-02-20 11:42:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:42,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:42:42,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:42:42,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:42:42,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-20 11:42:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:42,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-20 11:42:42,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:42:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:42,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:42:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:42,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233721787] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:42:42,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:42:42,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-02-20 11:42:42,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310956421] [2024-02-20 11:42:42,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:42:42,305 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-20 11:42:42,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:42,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-20 11:42:42,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:42:42,306 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:42,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 1997 transitions, 124492 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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 11:42:42,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:42,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:42,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:46,645 INFO L124 PetriNetUnfolderBase]: 4159/7552 cut-off events. [2024-02-20 11:42:46,645 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2024-02-20 11:42:46,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240449 conditions, 7552 events. 4159/7552 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 51730 event pairs, 0 based on Foata normal form. 0/6332 useless extension candidates. Maximal degree in co-relation 231431. Up to 7496 conditions per place. [2024-02-20 11:42:46,746 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 2301 selfloop transitions, 200 changer transitions 194/2696 dead transitions. [2024-02-20 11:42:46,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 2696 transitions, 173403 flow [2024-02-20 11:42:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 11:42:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 11:42:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-02-20 11:42:46,747 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-02-20 11:42:46,747 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 441 predicate places. [2024-02-20 11:42:46,748 INFO L507 AbstractCegarLoop]: Abstraction has has 468 places, 2696 transitions, 173403 flow [2024-02-20 11:42:46,748 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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 11:42:46,748 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:46,748 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:46,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-20 11:42:46,958 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:42:46,959 INFO L432 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:46,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 117135448, now seen corresponding path program 1 times [2024-02-20 11:42:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105307159] [2024-02-20 11:42:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105307159] [2024-02-20 11:42:47,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105307159] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:42:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772623571] [2024-02-20 11:42:47,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:47,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:42:47,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:42:47,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:42:47,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-20 11:42:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:47,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:42:47,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:42:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:47,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:42:47,520 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2024-02-20 11:42:47,520 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 32 treesize of output 48 [2024-02-20 11:42:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:47,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772623571] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:42:47,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:42:47,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2024-02-20 11:42:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058148126] [2024-02-20 11:42:47,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:42:47,531 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 11:42:47,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:47,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 11:42:47,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-02-20 11:42:47,532 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:47,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 2696 transitions, 173403 flow. Second operand has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 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 11:42:47,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:47,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:47,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:54,120 INFO L124 PetriNetUnfolderBase]: 4236/7682 cut-off events. [2024-02-20 11:42:54,121 INFO L125 PetriNetUnfolderBase]: For 771/771 co-relation queries the response was YES. [2024-02-20 11:42:54,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252275 conditions, 7682 events. 4236/7682 cut-off events. For 771/771 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 52777 event pairs, 0 based on Foata normal form. 0/6462 useless extension candidates. Maximal degree in co-relation 243049. Up to 7627 conditions per place. [2024-02-20 11:42:54,323 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 1756 selfloop transitions, 868 changer transitions 194/2819 dead transitions. [2024-02-20 11:42:54,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 2819 transitions, 186932 flow [2024-02-20 11:42:54,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-02-20 11:42:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-02-20 11:42:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 230 transitions. [2024-02-20 11:42:54,324 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3605015673981191 [2024-02-20 11:42:54,324 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 462 predicate places. [2024-02-20 11:42:54,324 INFO L507 AbstractCegarLoop]: Abstraction has has 489 places, 2819 transitions, 186932 flow [2024-02-20 11:42:54,325 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 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 11:42:54,325 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:54,325 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:54,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-20 11:42:54,545 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-02-20 11:42:54,546 INFO L432 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:54,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash 158872334, now seen corresponding path program 2 times [2024-02-20 11:42:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:54,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338756563] [2024-02-20 11:42:54,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:54,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:54,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338756563] [2024-02-20 11:42:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338756563] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:42:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611595878] [2024-02-20 11:42:54,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:42:54,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:42:54,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:42:54,825 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:42:54,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-20 11:42:54,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:42:54,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:42:54,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-20 11:42:54,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:42:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:55,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:42:55,210 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2024-02-20 11:42:55,211 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 32 treesize of output 48 [2024-02-20 11:42:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:42:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611595878] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:42:55,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:42:55,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2024-02-20 11:42:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642135958] [2024-02-20 11:42:55,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:42:55,228 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 11:42:55,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:55,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 11:42:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-02-20 11:42:55,229 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:42:55,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 2819 transitions, 186932 flow. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 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 11:42:55,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:55,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:42:55,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:43:04,684 INFO L124 PetriNetUnfolderBase]: 5638/10213 cut-off events. [2024-02-20 11:43:04,684 INFO L125 PetriNetUnfolderBase]: For 1032/1032 co-relation queries the response was YES. [2024-02-20 11:43:04,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345142 conditions, 10213 events. 5638/10213 cut-off events. For 1032/1032 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 74070 event pairs, 24 based on Foata normal form. 0/8529 useless extension candidates. Maximal degree in co-relation 331906. Up to 10129 conditions per place. [2024-02-20 11:43:04,948 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 2531 selfloop transitions, 938 changer transitions 201/3671 dead transitions. [2024-02-20 11:43:04,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 3671 transitions, 250783 flow [2024-02-20 11:43:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-02-20 11:43:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-02-20 11:43:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 302 transitions. [2024-02-20 11:43:04,949 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4339080459770115 [2024-02-20 11:43:04,949 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 485 predicate places. [2024-02-20 11:43:04,950 INFO L507 AbstractCegarLoop]: Abstraction has has 512 places, 3671 transitions, 250783 flow [2024-02-20 11:43:04,950 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 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 11:43:04,950 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:43:04,950 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:43:04,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-20 11:43:05,161 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:43:05,161 INFO L432 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:43:05,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:43:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1931387763, now seen corresponding path program 1 times [2024-02-20 11:43:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:43:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693885330] [2024-02-20 11:43:05,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:43:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:43:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:43:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:43:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:43:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693885330] [2024-02-20 11:43:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693885330] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:43:05,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:43:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:43:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523075784] [2024-02-20 11:43:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:43:05,433 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:43:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:43:05,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:43:05,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:43:05,434 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:43:05,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 3671 transitions, 250783 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:43:05,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:43:05,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:43:05,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:43:19,106 INFO L124 PetriNetUnfolderBase]: 5690/10343 cut-off events. [2024-02-20 11:43:19,106 INFO L125 PetriNetUnfolderBase]: For 1033/1033 co-relation queries the response was YES. [2024-02-20 11:43:19,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359698 conditions, 10343 events. 5690/10343 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 75615 event pairs, 16 based on Foata normal form. 0/8649 useless extension candidates. Maximal degree in co-relation 345792. Up to 10255 conditions per place. [2024-02-20 11:43:19,285 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 2942 selfloop transitions, 559 changer transitions 211/3713 dead transitions. [2024-02-20 11:43:19,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 3713 transitions, 261084 flow [2024-02-20 11:43:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-20 11:43:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-20 11:43:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 174 transitions. [2024-02-20 11:43:19,286 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-02-20 11:43:19,287 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 499 predicate places. [2024-02-20 11:43:19,287 INFO L507 AbstractCegarLoop]: Abstraction has has 526 places, 3713 transitions, 261084 flow [2024-02-20 11:43:19,287 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:43:19,287 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:43:19,287 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:43:19,287 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-02-20 11:43:19,287 INFO L432 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:43:19,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:43:19,288 INFO L85 PathProgramCache]: Analyzing trace with hash -944588493, now seen corresponding path program 2 times [2024-02-20 11:43:19,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:43:19,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343942506] [2024-02-20 11:43:19,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:43:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:43:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:43:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:43:19,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:43:19,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343942506] [2024-02-20 11:43:19,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343942506] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:43:19,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:43:19,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:43:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138854799] [2024-02-20 11:43:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:43:19,754 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:43:19,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:43:19,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:43:19,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:43:19,754 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:43:19,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 3713 transitions, 261084 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:43:19,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:43:19,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:43:19,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:43:36,259 INFO L124 PetriNetUnfolderBase]: 5724/10399 cut-off events. [2024-02-20 11:43:36,260 INFO L125 PetriNetUnfolderBase]: For 1058/1058 co-relation queries the response was YES. [2024-02-20 11:43:36,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371970 conditions, 10399 events. 5724/10399 cut-off events. For 1058/1058 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 76171 event pairs, 24 based on Foata normal form. 0/8699 useless extension candidates. Maximal degree in co-relation 357674. Up to 10311 conditions per place. [2024-02-20 11:43:36,437 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 2959 selfloop transitions, 568 changer transitions 211/3739 dead transitions. [2024-02-20 11:43:36,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 3739 transitions, 270377 flow [2024-02-20 11:43:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:43:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:43:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-02-20 11:43:36,438 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42946708463949845 [2024-02-20 11:43:36,439 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 508 predicate places. [2024-02-20 11:43:36,439 INFO L507 AbstractCegarLoop]: Abstraction has has 535 places, 3739 transitions, 270377 flow [2024-02-20 11:43:36,439 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:43:36,439 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:43:36,439 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:43:36,439 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-02-20 11:43:36,439 INFO L432 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:43:36,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:43:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1178501660, now seen corresponding path program 3 times [2024-02-20 11:43:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:43:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5028789] [2024-02-20 11:43:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:43:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:43:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:43:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:43:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:43:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5028789] [2024-02-20 11:43:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5028789] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:43:36,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:43:36,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:43:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620102238] [2024-02-20 11:43:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:43:36,768 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:43:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:43:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:43:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:43:36,769 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:43:36,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 3739 transitions, 270377 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:43:36,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:43:36,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:43:36,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:43:53,312 INFO L124 PetriNetUnfolderBase]: 5676/10296 cut-off events. [2024-02-20 11:43:53,312 INFO L125 PetriNetUnfolderBase]: For 1044/1044 co-relation queries the response was YES. [2024-02-20 11:43:53,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378580 conditions, 10296 events. 5676/10296 cut-off events. For 1044/1044 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 75038 event pairs, 32 based on Foata normal form. 0/8616 useless extension candidates. Maximal degree in co-relation 364122. Up to 10211 conditions per place. [2024-02-20 11:43:53,497 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 2870 selfloop transitions, 605 changer transitions 211/3687 dead transitions. [2024-02-20 11:43:53,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 3687 transitions, 273996 flow [2024-02-20 11:43:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-20 11:43:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-20 11:43:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-02-20 11:43:53,498 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4367816091954023 [2024-02-20 11:43:53,498 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 514 predicate places. [2024-02-20 11:43:53,499 INFO L507 AbstractCegarLoop]: Abstraction has has 541 places, 3687 transitions, 273996 flow [2024-02-20 11:43:53,499 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:43:53,499 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:43:53,499 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:43:53,499 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-02-20 11:43:53,499 INFO L432 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:43:53,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:43:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -690690672, now seen corresponding path program 4 times [2024-02-20 11:43:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:43:53,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201103343] [2024-02-20 11:43:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:43:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:43:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:43:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:43:53,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:43:53,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201103343] [2024-02-20 11:43:53,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201103343] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:43:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:43:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:43:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432527613] [2024-02-20 11:43:53,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:43:53,852 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:43:53,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:43:53,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:43:53,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:43:53,852 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:43:53,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 3687 transitions, 273996 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:43:53,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:43:53,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:43:53,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:44:06,315 INFO L124 PetriNetUnfolderBase]: 5622/10199 cut-off events. [2024-02-20 11:44:06,316 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2024-02-20 11:44:06,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385141 conditions, 10199 events. 5622/10199 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 74245 event pairs, 48 based on Foata normal form. 0/8539 useless extension candidates. Maximal degree in co-relation 370377. Up to 10115 conditions per place. [2024-02-20 11:44:06,665 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3234 selfloop transitions, 207 changer transitions 214/3656 dead transitions. [2024-02-20 11:44:06,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 3656 transitions, 279006 flow [2024-02-20 11:44:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:44:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:44:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-02-20 11:44:06,669 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3949843260188088 [2024-02-20 11:44:06,670 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 522 predicate places. [2024-02-20 11:44:06,670 INFO L507 AbstractCegarLoop]: Abstraction has has 549 places, 3656 transitions, 279006 flow [2024-02-20 11:44:06,670 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:44:06,670 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:44:06,670 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:44:06,670 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-02-20 11:44:06,670 INFO L432 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:44:06,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:44:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash -689750138, now seen corresponding path program 5 times [2024-02-20 11:44:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:44:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329785829] [2024-02-20 11:44:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:44:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:44:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:44:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:44:06,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:44:06,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329785829] [2024-02-20 11:44:06,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329785829] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:44:06,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056756452] [2024-02-20 11:44:06,975 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 11:44:06,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:44:06,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:44:06,989 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:44:06,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-20 11:44:07,193 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-02-20 11:44:07,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:44:07,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-20 11:44:07,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:44:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:44:07,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:44:07,411 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-02-20 11:44:07,411 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 40 treesize of output 56 [2024-02-20 11:44:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:44:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056756452] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:44:07,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:44:07,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2024-02-20 11:44:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468639270] [2024-02-20 11:44:07,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:44:07,438 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-20 11:44:07,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:44:07,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-20 11:44:07,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-02-20 11:44:07,439 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:44:07,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 3656 transitions, 279006 flow. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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 11:44:07,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:44:07,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:44:07,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:44:20,266 INFO L124 PetriNetUnfolderBase]: 5668/10286 cut-off events. [2024-02-20 11:44:20,267 INFO L125 PetriNetUnfolderBase]: For 1072/1072 co-relation queries the response was YES. [2024-02-20 11:44:20,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398696 conditions, 10286 events. 5668/10286 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 75031 event pairs, 40 based on Foata normal form. 0/8636 useless extension candidates. Maximal degree in co-relation 383630. Up to 10203 conditions per place. [2024-02-20 11:44:20,446 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 2705 selfloop transitions, 784 changer transitions 214/3704 dead transitions. [2024-02-20 11:44:20,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 3704 transitions, 290084 flow [2024-02-20 11:44:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-20 11:44:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-20 11:44:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 241 transitions. [2024-02-20 11:44:20,447 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43738656987295826 [2024-02-20 11:44:20,448 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 539 predicate places. [2024-02-20 11:44:20,448 INFO L507 AbstractCegarLoop]: Abstraction has has 566 places, 3704 transitions, 290084 flow [2024-02-20 11:44:20,448 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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 11:44:20,448 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:44:20,448 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:44:20,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-02-20 11:44:20,658 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-02-20 11:44:20,659 INFO L432 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:44:20,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:44:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1417832015, now seen corresponding path program 3 times [2024-02-20 11:44:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:44:20,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175262301] [2024-02-20 11:44:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:44:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:44:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:44:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:44:20,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:44:20,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175262301] [2024-02-20 11:44:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175262301] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:44:20,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:44:20,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:44:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548942576] [2024-02-20 11:44:20,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:44:20,949 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:44:20,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:44:20,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:44:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:44:20,949 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:44:20,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 3704 transitions, 290084 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:44:20,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:44:20,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:44:20,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:44:35,395 INFO L124 PetriNetUnfolderBase]: 5772/10511 cut-off events. [2024-02-20 11:44:35,395 INFO L125 PetriNetUnfolderBase]: For 1071/1071 co-relation queries the response was YES. [2024-02-20 11:44:35,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417760 conditions, 10511 events. 5772/10511 cut-off events. For 1071/1071 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 77394 event pairs, 24 based on Foata normal form. 0/8835 useless extension candidates. Maximal degree in co-relation 401945. Up to 10424 conditions per place. [2024-02-20 11:44:35,601 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3434 selfloop transitions, 118 changer transitions 224/3777 dead transitions. [2024-02-20 11:44:35,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 3777 transitions, 303360 flow [2024-02-20 11:44:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 11:44:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 11:44:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-02-20 11:44:35,624 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38726790450928383 [2024-02-20 11:44:35,625 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 551 predicate places. [2024-02-20 11:44:35,625 INFO L507 AbstractCegarLoop]: Abstraction has has 578 places, 3777 transitions, 303360 flow [2024-02-20 11:44:35,626 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:44:35,626 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:44:35,626 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:44:35,626 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-02-20 11:44:35,626 INFO L432 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:44:35,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:44:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash 570145854, now seen corresponding path program 6 times [2024-02-20 11:44:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:44:35,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276543543] [2024-02-20 11:44:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:44:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:44:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:44:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:44:35,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:44:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276543543] [2024-02-20 11:44:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276543543] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:44:35,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:44:35,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:44:35,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645605284] [2024-02-20 11:44:35,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:44:35,910 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:44:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:44:35,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:44:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:44:35,910 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:44:35,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 3777 transitions, 303360 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:44:35,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:44:35,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:44:35,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:44:50,419 INFO L124 PetriNetUnfolderBase]: 5768/10507 cut-off events. [2024-02-20 11:44:50,419 INFO L125 PetriNetUnfolderBase]: For 1071/1071 co-relation queries the response was YES. [2024-02-20 11:44:50,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428022 conditions, 10507 events. 5768/10507 cut-off events. For 1071/1071 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 77510 event pairs, 24 based on Foata normal form. 0/8835 useless extension candidates. Maximal degree in co-relation 411818. Up to 10420 conditions per place. [2024-02-20 11:44:50,763 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3267 selfloop transitions, 278 changer transitions 230/3776 dead transitions. [2024-02-20 11:44:50,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 3776 transitions, 310830 flow [2024-02-20 11:44:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 11:44:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 11:44:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 148 transitions. [2024-02-20 11:44:50,764 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3645320197044335 [2024-02-20 11:44:50,764 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 564 predicate places. [2024-02-20 11:44:50,764 INFO L507 AbstractCegarLoop]: Abstraction has has 591 places, 3776 transitions, 310830 flow [2024-02-20 11:44:50,765 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:44:50,765 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:44:50,765 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:44:50,765 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-02-20 11:44:50,765 INFO L432 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:44:50,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:44:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1650152821, now seen corresponding path program 4 times [2024-02-20 11:44:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:44:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050162] [2024-02-20 11:44:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:44:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:44:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:44:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:44:51,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:44:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050162] [2024-02-20 11:44:51,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050162] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:44:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353394927] [2024-02-20 11:44:51,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 11:44:51,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:44:51,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:44:51,112 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:44:51,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-20 11:44:51,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 11:44:51,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:44:51,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:44:51,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:44:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:44:51,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:44:51,461 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-02-20 11:44:51,462 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 40 treesize of output 56 [2024-02-20 11:44:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:44:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353394927] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:44:51,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:44:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-02-20 11:44:51,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232439673] [2024-02-20 11:44:51,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:44:51,484 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-20 11:44:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:44:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-20 11:44:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-02-20 11:44:51,485 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:44:51,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 3776 transitions, 310830 flow. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 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 11:44:51,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:44:51,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:44:51,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:45:12,003 INFO L124 PetriNetUnfolderBase]: 6042/11132 cut-off events. [2024-02-20 11:45:12,004 INFO L125 PetriNetUnfolderBase]: For 1136/1136 co-relation queries the response was YES. [2024-02-20 11:45:12,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464044 conditions, 11132 events. 6042/11132 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 84165 event pairs, 16 based on Foata normal form. 0/9390 useless extension candidates. Maximal degree in co-relation 445989. Up to 11028 conditions per place. [2024-02-20 11:45:12,378 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 3068 selfloop transitions, 756 changer transitions 230/4055 dead transitions. [2024-02-20 11:45:12,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 4055 transitions, 341954 flow [2024-02-20 11:45:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-20 11:45:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-20 11:45:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 190 transitions. [2024-02-20 11:45:12,379 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40948275862068967 [2024-02-20 11:45:12,379 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 579 predicate places. [2024-02-20 11:45:12,380 INFO L507 AbstractCegarLoop]: Abstraction has has 606 places, 4055 transitions, 341954 flow [2024-02-20 11:45:12,380 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 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 11:45:12,380 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:45:12,380 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:45:12,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-02-20 11:45:12,592 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-02-20 11:45:12,593 INFO L432 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:45:12,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:45:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1082765291, now seen corresponding path program 5 times [2024-02-20 11:45:12,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:45:12,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606663890] [2024-02-20 11:45:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:45:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:45:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:45:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:45:12,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:45:12,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606663890] [2024-02-20 11:45:12,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606663890] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:45:12,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:45:12,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:45:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523381226] [2024-02-20 11:45:12,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:45:12,909 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:45:12,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:45:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:45:12,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:45:12,910 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:45:12,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 4055 transitions, 341954 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:45:12,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:45:12,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:45:12,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:45:36,064 INFO L124 PetriNetUnfolderBase]: 6030/11114 cut-off events. [2024-02-20 11:45:36,064 INFO L125 PetriNetUnfolderBase]: For 1117/1117 co-relation queries the response was YES. [2024-02-20 11:45:36,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474299 conditions, 11114 events. 6030/11114 cut-off events. For 1117/1117 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 84097 event pairs, 8 based on Foata normal form. 0/9378 useless extension candidates. Maximal degree in co-relation 455821. Up to 11010 conditions per place. [2024-02-20 11:45:36,315 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3683 selfloop transitions, 125 changer transitions 240/4049 dead transitions. [2024-02-20 11:45:36,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 4049 transitions, 349543 flow [2024-02-20 11:45:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 11:45:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 11:45:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 147 transitions. [2024-02-20 11:45:36,316 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-02-20 11:45:36,317 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 592 predicate places. [2024-02-20 11:45:36,317 INFO L507 AbstractCegarLoop]: Abstraction has has 619 places, 4049 transitions, 349543 flow [2024-02-20 11:45:36,317 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:45:36,317 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:45:36,317 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:45:36,317 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-02-20 11:45:36,317 INFO L432 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:45:36,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:45:36,318 INFO L85 PathProgramCache]: Analyzing trace with hash 651465393, now seen corresponding path program 6 times [2024-02-20 11:45:36,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:45:36,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832994820] [2024-02-20 11:45:36,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:45:36,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:45:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:45:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:45:36,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:45:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832994820] [2024-02-20 11:45:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832994820] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:45:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047249801] [2024-02-20 11:45:36,615 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-20 11:45:36,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:45:36,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:45:36,616 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:45:36,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-02-20 11:45:36,804 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-20 11:45:36,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:45:36,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-20 11:45:36,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:45:37,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 11:45:37,043 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 118 treesize of output 70 [2024-02-20 11:45:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:45:37,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:45:37,164 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-02-20 11:45:37,165 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 111 treesize of output 95 [2024-02-20 11:45:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:45:37,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047249801] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 11:45:37,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 11:45:37,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 17 [2024-02-20 11:45:37,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994653163] [2024-02-20 11:45:37,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:45:37,255 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 11:45:37,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:45:37,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 11:45:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-02-20 11:45:37,256 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:45:37,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 4049 transitions, 349543 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:45:37,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:45:37,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:45:37,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:46:03,994 INFO L124 PetriNetUnfolderBase]: 6330/11779 cut-off events. [2024-02-20 11:46:03,994 INFO L125 PetriNetUnfolderBase]: For 1197/1197 co-relation queries the response was YES. [2024-02-20 11:46:04,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513890 conditions, 11779 events. 6330/11779 cut-off events. For 1197/1197 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 91089 event pairs, 0 based on Foata normal form. 0/9961 useless extension candidates. Maximal degree in co-relation 493459. Up to 11658 conditions per place. [2024-02-20 11:46:04,250 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 3382 selfloop transitions, 692 changer transitions 240/4315 dead transitions. [2024-02-20 11:46:04,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 4315 transitions, 381173 flow [2024-02-20 11:46:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:46:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:46:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2024-02-20 11:46:04,260 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49216300940438873 [2024-02-20 11:46:04,261 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 601 predicate places. [2024-02-20 11:46:04,261 INFO L507 AbstractCegarLoop]: Abstraction has has 628 places, 4315 transitions, 381173 flow [2024-02-20 11:46:04,261 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:46:04,261 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:46:04,261 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:46:04,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-02-20 11:46:04,472 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-02-20 11:46:04,473 INFO L432 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:46:04,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:46:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash 329879188, now seen corresponding path program 7 times [2024-02-20 11:46:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:46:04,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194704878] [2024-02-20 11:46:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:46:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:46:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:46:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:46:04,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:46:04,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194704878] [2024-02-20 11:46:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194704878] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:46:04,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:46:04,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:46:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285026120] [2024-02-20 11:46:04,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:46:04,807 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:46:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:46:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:46:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:46:04,808 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:46:04,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 4315 transitions, 381173 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:46:04,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:46:04,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:46:04,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:46:32,511 INFO L124 PetriNetUnfolderBase]: 6196/11569 cut-off events. [2024-02-20 11:46:32,511 INFO L125 PetriNetUnfolderBase]: For 1178/1178 co-relation queries the response was YES. [2024-02-20 11:46:32,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516099 conditions, 11569 events. 6196/11569 cut-off events. For 1178/1178 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 89555 event pairs, 0 based on Foata normal form. 0/9823 useless extension candidates. Maximal degree in co-relation 493409. Up to 11448 conditions per place. [2024-02-20 11:46:32,747 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 3371 selfloop transitions, 641 changer transitions 241/4254 dead transitions. [2024-02-20 11:46:32,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 4254 transitions, 384314 flow [2024-02-20 11:46:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-20 11:46:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-20 11:46:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-02-20 11:46:32,748 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46264367816091956 [2024-02-20 11:46:32,748 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 612 predicate places. [2024-02-20 11:46:32,748 INFO L507 AbstractCegarLoop]: Abstraction has has 639 places, 4254 transitions, 384314 flow [2024-02-20 11:46:32,749 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:46:32,749 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:46:32,749 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:46:32,749 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-02-20 11:46:32,749 INFO L432 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:46:32,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:46:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1782549442, now seen corresponding path program 8 times [2024-02-20 11:46:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:46:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268855364] [2024-02-20 11:46:32,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:46:32,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:46:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:46:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:46:33,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:46:33,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268855364] [2024-02-20 11:46:33,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268855364] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:46:33,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:46:33,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:46:33,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151773071] [2024-02-20 11:46:33,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:46:33,245 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:46:33,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:46:33,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:46:33,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:46:33,246 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:46:33,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 4254 transitions, 384314 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:46:33,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:46:33,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:46:33,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:46:58,350 INFO L124 PetriNetUnfolderBase]: 5998/11161 cut-off events. [2024-02-20 11:46:58,350 INFO L125 PetriNetUnfolderBase]: For 1166/1166 co-relation queries the response was YES. [2024-02-20 11:46:58,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509201 conditions, 11161 events. 5998/11161 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 85324 event pairs, 0 based on Foata normal form. 0/9493 useless extension candidates. Maximal degree in co-relation 486954. Up to 11050 conditions per place. [2024-02-20 11:46:58,576 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 3261 selfloop transitions, 620 changer transitions 241/4123 dead transitions. [2024-02-20 11:46:58,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 4123 transitions, 380708 flow [2024-02-20 11:46:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-20 11:46:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-20 11:46:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2024-02-20 11:46:58,577 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4396551724137931 [2024-02-20 11:46:58,578 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 623 predicate places. [2024-02-20 11:46:58,578 INFO L507 AbstractCegarLoop]: Abstraction has has 650 places, 4123 transitions, 380708 flow [2024-02-20 11:46:58,579 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:46:58,579 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:46:58,579 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:46:58,579 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-02-20 11:46:58,579 INFO L432 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:46:58,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:46:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash 764706651, now seen corresponding path program 7 times [2024-02-20 11:46:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:46:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316296634] [2024-02-20 11:46:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:46:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:46:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:46:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:46:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:46:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316296634] [2024-02-20 11:46:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316296634] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:46:58,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:46:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:46:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76632563] [2024-02-20 11:46:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:46:58,877 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:46:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:46:58,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:46:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:46:58,879 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:46:58,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 4123 transitions, 380708 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:46:58,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:46:58,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:46:58,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:47:23,168 INFO L124 PetriNetUnfolderBase]: 5968/11104 cut-off events. [2024-02-20 11:47:23,169 INFO L125 PetriNetUnfolderBase]: For 1129/1129 co-relation queries the response was YES. [2024-02-20 11:47:23,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517615 conditions, 11104 events. 5968/11104 cut-off events. For 1129/1129 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 84783 event pairs, 0 based on Foata normal form. 0/9448 useless extension candidates. Maximal degree in co-relation 494987. Up to 10994 conditions per place. [2024-02-20 11:47:23,418 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3724 selfloop transitions, 133 changer transitions 246/4104 dead transitions. [2024-02-20 11:47:23,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 4104 transitions, 387154 flow [2024-02-20 11:47:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:47:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:47:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-02-20 11:47:23,420 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3887147335423197 [2024-02-20 11:47:23,420 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 633 predicate places. [2024-02-20 11:47:23,420 INFO L507 AbstractCegarLoop]: Abstraction has has 660 places, 4104 transitions, 387154 flow [2024-02-20 11:47:23,420 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:47:23,420 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:47:23,420 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:47:23,421 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-02-20 11:47:23,421 INFO L432 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:47:23,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:47:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1491847994, now seen corresponding path program 9 times [2024-02-20 11:47:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:47:23,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647920639] [2024-02-20 11:47:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:47:23,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:47:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:47:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:47:23,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:47:23,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647920639] [2024-02-20 11:47:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647920639] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:47:23,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:47:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:47:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624648248] [2024-02-20 11:47:23,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:47:23,711 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:47:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:47:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:47:23,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:47:23,712 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:47:23,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 4104 transitions, 387154 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:47:23,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:47:23,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:47:23,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:47:48,498 INFO L124 PetriNetUnfolderBase]: 5896/10944 cut-off events. [2024-02-20 11:47:48,498 INFO L125 PetriNetUnfolderBase]: For 1131/1131 co-relation queries the response was YES. [2024-02-20 11:47:48,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521107 conditions, 10944 events. 5896/10944 cut-off events. For 1131/1131 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 83056 event pairs, 0 based on Foata normal form. 0/9308 useless extension candidates. Maximal degree in co-relation 498396. Up to 10838 conditions per place. [2024-02-20 11:47:48,735 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3498 selfloop transitions, 304 changer transitions 249/4052 dead transitions. [2024-02-20 11:47:48,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 4052 transitions, 390344 flow [2024-02-20 11:47:48,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 11:47:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 11:47:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 142 transitions. [2024-02-20 11:47:48,735 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.376657824933687 [2024-02-20 11:47:48,736 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 636 predicate places. [2024-02-20 11:47:48,736 INFO L507 AbstractCegarLoop]: Abstraction has has 663 places, 4052 transitions, 390344 flow [2024-02-20 11:47:48,736 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:47:48,736 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:47:48,736 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:47:48,736 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-02-20 11:47:48,736 INFO L432 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:47:48,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:47:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1468288667, now seen corresponding path program 8 times [2024-02-20 11:47:48,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:47:48,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109775210] [2024-02-20 11:47:48,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:47:48,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:47:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:47:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:47:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:47:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109775210] [2024-02-20 11:47:49,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109775210] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:47:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505666933] [2024-02-20 11:47:49,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:47:49,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:47:49,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:47:49,247 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:47:49,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-02-20 11:47:49,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:47:49,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:47:49,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-20 11:47:49,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:47:49,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 11:47:49,548 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 118 treesize of output 70 [2024-02-20 11:47:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:47:49,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:47:49,646 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2024-02-20 11:47:49,646 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 40 treesize of output 56 [2024-02-20 11:47:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:47:49,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505666933] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:47:49,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:47:49,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 17 [2024-02-20 11:47:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562316665] [2024-02-20 11:47:49,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:47:49,673 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-20 11:47:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:47:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-20 11:47:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-02-20 11:47:49,673 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:47:49,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 4052 transitions, 390344 flow. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 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 11:47:49,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:47:49,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:47:49,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:48:10,906 INFO L124 PetriNetUnfolderBase]: 5884/10854 cut-off events. [2024-02-20 11:48:10,906 INFO L125 PetriNetUnfolderBase]: For 1058/1058 co-relation queries the response was YES. [2024-02-20 11:48:10,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527986 conditions, 10854 events. 5884/10854 cut-off events. For 1058/1058 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 81354 event pairs, 0 based on Foata normal form. 0/9258 useless extension candidates. Maximal degree in co-relation 505708. Up to 10758 conditions per place. [2024-02-20 11:48:11,178 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 2905 selfloop transitions, 876 changer transitions 251/4033 dead transitions. [2024-02-20 11:48:11,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 4033 transitions, 396515 flow [2024-02-20 11:48:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-20 11:48:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-20 11:48:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 225 transitions. [2024-02-20 11:48:11,179 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3694581280788177 [2024-02-20 11:48:11,181 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 654 predicate places. [2024-02-20 11:48:11,181 INFO L507 AbstractCegarLoop]: Abstraction has has 681 places, 4033 transitions, 396515 flow [2024-02-20 11:48:11,181 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 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 11:48:11,181 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:48:11,181 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:48:11,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-02-20 11:48:11,392 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-02-20 11:48:11,393 INFO L432 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:48:11,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:48:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash 276526007, now seen corresponding path program 9 times [2024-02-20 11:48:11,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:48:11,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189973654] [2024-02-20 11:48:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:48:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:48:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:48:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:48:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:48:11,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189973654] [2024-02-20 11:48:11,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189973654] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:48:11,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:48:11,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:48:11,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717810455] [2024-02-20 11:48:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:48:11,656 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:48:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:48:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:48:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:48:11,657 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:48:11,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 4033 transitions, 396515 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:48:11,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:48:11,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:48:11,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:48:33,684 INFO L124 PetriNetUnfolderBase]: 5878/10848 cut-off events. [2024-02-20 11:48:33,685 INFO L125 PetriNetUnfolderBase]: For 1072/1072 co-relation queries the response was YES. [2024-02-20 11:48:33,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538446 conditions, 10848 events. 5878/10848 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 81407 event pairs, 0 based on Foata normal form. 0/9258 useless extension candidates. Maximal degree in co-relation 515719. Up to 10752 conditions per place. [2024-02-20 11:48:34,086 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3483 selfloop transitions, 287 changer transitions 261/4032 dead transitions. [2024-02-20 11:48:34,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 4032 transitions, 404479 flow [2024-02-20 11:48:34,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 11:48:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 11:48:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 143 transitions. [2024-02-20 11:48:34,088 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3522167487684729 [2024-02-20 11:48:34,088 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 667 predicate places. [2024-02-20 11:48:34,088 INFO L507 AbstractCegarLoop]: Abstraction has has 694 places, 4032 transitions, 404479 flow [2024-02-20 11:48:34,088 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:48:34,088 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:48:34,088 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:48:34,089 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-02-20 11:48:34,089 INFO L432 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:48:34,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:48:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1959495034, now seen corresponding path program 10 times [2024-02-20 11:48:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:48:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333593940] [2024-02-20 11:48:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:48:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:48:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:48:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:48:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:48:34,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333593940] [2024-02-20 11:48:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333593940] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:48:34,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:48:34,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:48:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594364645] [2024-02-20 11:48:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:48:34,452 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:48:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:48:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:48:34,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:48:34,452 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:48:34,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 4032 transitions, 404479 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:48:34,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:48:34,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:48:34,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:49:02,545 INFO L124 PetriNetUnfolderBase]: 5888/10863 cut-off events. [2024-02-20 11:49:02,545 INFO L125 PetriNetUnfolderBase]: For 1049/1049 co-relation queries the response was YES. [2024-02-20 11:49:02,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550016 conditions, 10863 events. 5888/10863 cut-off events. For 1049/1049 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 81462 event pairs, 0 based on Foata normal form. 0/9283 useless extension candidates. Maximal degree in co-relation 526944. Up to 10768 conditions per place. [2024-02-20 11:49:02,814 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 3231 selfloop transitions, 557 changer transitions 261/4050 dead transitions. [2024-02-20 11:49:02,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 4050 transitions, 414383 flow [2024-02-20 11:49:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-20 11:49:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-20 11:49:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-02-20 11:49:02,815 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4241379310344828 [2024-02-20 11:49:02,815 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 676 predicate places. [2024-02-20 11:49:02,815 INFO L507 AbstractCegarLoop]: Abstraction has has 703 places, 4050 transitions, 414383 flow [2024-02-20 11:49:02,816 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:49:02,816 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:49:02,816 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:49:02,816 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-02-20 11:49:02,816 INFO L432 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:49:02,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:49:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash -236093430, now seen corresponding path program 11 times [2024-02-20 11:49:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:49:02,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105635316] [2024-02-20 11:49:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:49:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:49:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:49:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:49:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:49:03,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105635316] [2024-02-20 11:49:03,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105635316] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:49:03,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:49:03,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:49:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170263941] [2024-02-20 11:49:03,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:49:03,201 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:49:03,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:49:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:49:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:49:03,201 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:49:03,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 4050 transitions, 414383 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:49:03,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:49:03,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:49:03,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:49:25,874 INFO L124 PetriNetUnfolderBase]: 6022/11136 cut-off events. [2024-02-20 11:49:25,874 INFO L125 PetriNetUnfolderBase]: For 1121/1121 co-relation queries the response was YES. [2024-02-20 11:49:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574804 conditions, 11136 events. 6022/11136 cut-off events. For 1121/1121 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 84221 event pairs, 0 based on Foata normal form. 0/9518 useless extension candidates. Maximal degree in co-relation 550808. Up to 11037 conditions per place. [2024-02-20 11:49:26,157 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3669 selfloop transitions, 197 changer transitions 270/4137 dead transitions. [2024-02-20 11:49:26,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 4137 transitions, 431586 flow [2024-02-20 11:49:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 11:49:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 11:49:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 148 transitions. [2024-02-20 11:49:26,159 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3645320197044335 [2024-02-20 11:49:26,159 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 689 predicate places. [2024-02-20 11:49:26,159 INFO L507 AbstractCegarLoop]: Abstraction has has 716 places, 4137 transitions, 431586 flow [2024-02-20 11:49:26,159 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:49:26,159 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:49:26,159 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:49:26,160 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-02-20 11:49:26,160 INFO L432 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:49:26,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:49:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2106459153, now seen corresponding path program 10 times [2024-02-20 11:49:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:49:26,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121378922] [2024-02-20 11:49:26,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:49:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:49:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:49:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:49:26,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:49:26,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121378922] [2024-02-20 11:49:26,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121378922] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:49:26,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:49:26,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:49:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013257730] [2024-02-20 11:49:26,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:49:26,421 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:49:26,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:49:26,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:49:26,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:49:26,422 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:49:26,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 4137 transitions, 431586 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:49:26,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:49:26,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:49:26,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:49:54,733 INFO L124 PetriNetUnfolderBase]: 6483/12027 cut-off events. [2024-02-20 11:49:54,733 INFO L125 PetriNetUnfolderBase]: For 1270/1270 co-relation queries the response was YES. [2024-02-20 11:49:54,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632399 conditions, 12027 events. 6483/12027 cut-off events. For 1270/1270 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 92885 event pairs, 0 based on Foata normal form. 0/10273 useless extension candidates. Maximal degree in co-relation 606435. Up to 11914 conditions per place. [2024-02-20 11:49:55,046 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 3475 selfloop transitions, 710 changer transitions 270/4456 dead transitions. [2024-02-20 11:49:55,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 4456 transitions, 473804 flow [2024-02-20 11:49:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:49:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:49:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-02-20 11:49:55,048 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45768025078369906 [2024-02-20 11:49:55,048 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 699 predicate places. [2024-02-20 11:49:55,048 INFO L507 AbstractCegarLoop]: Abstraction has has 726 places, 4456 transitions, 473804 flow [2024-02-20 11:49:55,049 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:49:55,049 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:49:55,049 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:49:55,049 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-02-20 11:49:55,049 INFO L432 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:49:55,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:49:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1496929956, now seen corresponding path program 12 times [2024-02-20 11:49:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:49:55,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682542358] [2024-02-20 11:49:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:49:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:49:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:49:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:49:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:49:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682542358] [2024-02-20 11:49:55,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682542358] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:49:55,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:49:55,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:49:55,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565402435] [2024-02-20 11:49:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:49:55,476 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:49:55,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:49:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:49:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:49:55,477 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:49:55,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 4456 transitions, 473804 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:49:55,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:49:55,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:49:55,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:50:26,602 INFO L124 PetriNetUnfolderBase]: 6563/12203 cut-off events. [2024-02-20 11:50:26,603 INFO L125 PetriNetUnfolderBase]: For 1300/1300 co-relation queries the response was YES. [2024-02-20 11:50:26,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653625 conditions, 12203 events. 6563/12203 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 94802 event pairs, 0 based on Foata normal form. 0/10429 useless extension candidates. Maximal degree in co-relation 626737. Up to 12086 conditions per place. [2024-02-20 11:50:26,923 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 4072 selfloop transitions, 167 changer transitions 273/4513 dead transitions. [2024-02-20 11:50:26,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 4513 transitions, 488909 flow [2024-02-20 11:50:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:50:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:50:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-02-20 11:50:26,924 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3730407523510972 [2024-02-20 11:50:26,925 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 709 predicate places. [2024-02-20 11:50:26,925 INFO L507 AbstractCegarLoop]: Abstraction has has 736 places, 4513 transitions, 488909 flow [2024-02-20 11:50:26,925 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:50:26,925 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:50:26,925 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:50:26,925 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-02-20 11:50:26,925 INFO L432 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:50:26,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:50:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1695517047, now seen corresponding path program 11 times [2024-02-20 11:50:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:50:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644957090] [2024-02-20 11:50:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:50:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:50:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:50:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:50:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:50:27,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644957090] [2024-02-20 11:50:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644957090] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:50:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:50:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:50:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004628172] [2024-02-20 11:50:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:50:27,329 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:50:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:50:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:50:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:50:27,330 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:50:27,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 4513 transitions, 488909 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:50:27,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:50:27,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:50:27,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:50:59,524 INFO L124 PetriNetUnfolderBase]: 6359/11897 cut-off events. [2024-02-20 11:50:59,524 INFO L125 PetriNetUnfolderBase]: For 1246/1246 co-relation queries the response was YES. [2024-02-20 11:50:59,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648701 conditions, 11897 events. 6359/11897 cut-off events. For 1246/1246 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 92662 event pairs, 0 based on Foata normal form. 0/10219 useless extension candidates. Maximal degree in co-relation 621153. Up to 11777 conditions per place. [2024-02-20 11:50:59,831 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3446 selfloop transitions, 706 changer transitions 264/4417 dead transitions. [2024-02-20 11:50:59,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 4417 transitions, 487322 flow [2024-02-20 11:50:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-20 11:50:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-20 11:50:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2024-02-20 11:50:59,835 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4224137931034483 [2024-02-20 11:50:59,836 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 720 predicate places. [2024-02-20 11:50:59,836 INFO L507 AbstractCegarLoop]: Abstraction has has 747 places, 4417 transitions, 487322 flow [2024-02-20 11:50:59,836 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:50:59,836 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:50:59,836 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:50:59,836 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-02-20 11:50:59,836 INFO L432 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:50:59,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:50:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash -476360096, now seen corresponding path program 13 times [2024-02-20 11:50:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:50:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405465998] [2024-02-20 11:50:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:50:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:50:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:51:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:51:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:51:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405465998] [2024-02-20 11:51:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405465998] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:51:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:51:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:51:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983868190] [2024-02-20 11:51:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:51:00,253 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:51:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:51:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:51:00,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:51:00,253 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:51:00,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 4417 transitions, 487322 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:51:00,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:51:00,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:51:00,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:51:31,347 INFO L124 PetriNetUnfolderBase]: 6412/11988 cut-off events. [2024-02-20 11:51:31,347 INFO L125 PetriNetUnfolderBase]: For 1260/1260 co-relation queries the response was YES. [2024-02-20 11:51:31,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665580 conditions, 11988 events. 6412/11988 cut-off events. For 1260/1260 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 93434 event pairs, 0 based on Foata normal form. 0/10302 useless extension candidates. Maximal degree in co-relation 637537. Up to 11868 conditions per place. [2024-02-20 11:51:31,673 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3588 selfloop transitions, 607 changer transitions 264/4460 dead transitions. [2024-02-20 11:51:31,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 4460 transitions, 500982 flow [2024-02-20 11:51:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:51:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:51:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-02-20 11:51:31,675 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2024-02-20 11:51:31,675 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 730 predicate places. [2024-02-20 11:51:31,675 INFO L507 AbstractCegarLoop]: Abstraction has has 757 places, 4460 transitions, 500982 flow [2024-02-20 11:51:31,676 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:51:31,676 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:51:31,676 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:51:31,676 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-02-20 11:51:31,676 INFO L432 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:51:31,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:51:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 221089244, now seen corresponding path program 14 times [2024-02-20 11:51:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:51:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992945685] [2024-02-20 11:51:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:51:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:51:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:51:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:51:32,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:51:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992945685] [2024-02-20 11:51:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992945685] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:51:32,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:51:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:51:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689501040] [2024-02-20 11:51:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:51:32,131 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:51:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:51:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:51:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:51:32,132 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:51:32,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 4460 transitions, 500982 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:51:32,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:51:32,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:51:32,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:52:06,409 INFO L124 PetriNetUnfolderBase]: 6520/12212 cut-off events. [2024-02-20 11:52:06,410 INFO L125 PetriNetUnfolderBase]: For 1268/1268 co-relation queries the response was YES. [2024-02-20 11:52:06,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690010 conditions, 12212 events. 6520/12212 cut-off events. For 1268/1268 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 95716 event pairs, 0 based on Foata normal form. 0/10504 useless extension candidates. Maximal degree in co-relation 661008. Up to 12088 conditions per place. [2024-02-20 11:52:06,750 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 3624 selfloop transitions, 655 changer transitions 264/4544 dead transitions. [2024-02-20 11:52:06,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 4544 transitions, 519512 flow [2024-02-20 11:52:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:52:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:52:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-02-20 11:52:06,751 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4263322884012539 [2024-02-20 11:52:06,751 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 740 predicate places. [2024-02-20 11:52:06,751 INFO L507 AbstractCegarLoop]: Abstraction has has 767 places, 4544 transitions, 519512 flow [2024-02-20 11:52:06,751 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:52:06,751 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:52:06,752 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:52:06,752 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-02-20 11:52:06,752 INFO L432 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:52:06,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:52:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2070895997, now seen corresponding path program 12 times [2024-02-20 11:52:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:52:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036122974] [2024-02-20 11:52:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:52:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:52:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:52:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:52:07,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:52:07,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036122974] [2024-02-20 11:52:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036122974] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:52:07,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:52:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:52:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142378344] [2024-02-20 11:52:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:52:07,159 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:52:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:52:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:52:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:52:07,160 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:52:07,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 767 places, 4544 transitions, 519512 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:52:07,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:52:07,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:52:07,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:52:41,540 INFO L124 PetriNetUnfolderBase]: 6424/12014 cut-off events. [2024-02-20 11:52:41,541 INFO L125 PetriNetUnfolderBase]: For 1219/1219 co-relation queries the response was YES. [2024-02-20 11:52:41,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690825 conditions, 12014 events. 6424/12014 cut-off events. For 1219/1219 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 93728 event pairs, 0 based on Foata normal form. 0/10336 useless extension candidates. Maximal degree in co-relation 661792. Up to 11894 conditions per place. [2024-02-20 11:52:41,887 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 3888 selfloop transitions, 322 changer transitions 269/4480 dead transitions. [2024-02-20 11:52:41,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 4480 transitions, 521132 flow [2024-02-20 11:52:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 11:52:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 11:52:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 142 transitions. [2024-02-20 11:52:41,888 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.376657824933687 [2024-02-20 11:52:41,888 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 751 predicate places. [2024-02-20 11:52:41,889 INFO L507 AbstractCegarLoop]: Abstraction has has 778 places, 4480 transitions, 521132 flow [2024-02-20 11:52:41,889 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:52:41,889 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:52:41,889 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:52:41,889 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-02-20 11:52:41,890 INFO L432 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:52:41,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:52:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1721182756, now seen corresponding path program 15 times [2024-02-20 11:52:41,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:52:41,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685723125] [2024-02-20 11:52:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:52:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:52:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:52:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:52:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:52:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685723125] [2024-02-20 11:52:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685723125] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:52:42,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:52:42,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:52:42,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139110183] [2024-02-20 11:52:42,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:52:42,326 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:52:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:52:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:52:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:52:42,326 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-02-20 11:52:42,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 4480 transitions, 521132 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 11:52:42,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:52:42,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-02-20 11:52:42,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand