./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.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 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:02:21,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:02:21,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:02:21,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:02:21,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:02:22,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:02:22,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:02:22,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:02:22,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:02:22,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:02:22,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:02:22,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:02:22,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:02:22,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:02:22,007 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:02:22,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:02:22,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:02:22,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:02:22,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:02:22,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:02:22,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:02:22,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:02:22,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:02:22,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:02:22,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:02:22,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:02:22,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:02:22,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:02:22,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:02:22,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:02:22,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:02:22,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:02:22,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:02:22,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:02:22,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:02:22,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:02:22,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:02:22,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:02:22,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:02:22,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:02:22,014 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:02:22,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:02:22,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:02:22,015 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 -> 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:02:22,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:02:22,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:02:22,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:02:22,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:02:22,282 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:02:22,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2024-02-19 15:02:23,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:02:23,646 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:02:23,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2024-02-19 15:02:23,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4442007a0/96364b2b6cd943d08b8e70a308fa8e41/FLAGe9cf3820c [2024-02-19 15:02:23,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4442007a0/96364b2b6cd943d08b8e70a308fa8e41 [2024-02-19 15:02:23,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:02:23,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:02:23,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:02:23,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:02:23,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:02:23,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:23,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757bb229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23, skipping insertion in model container [2024-02-19 15:02:23,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:23,692 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:02:23,845 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2024-02-19 15:02:23,860 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:02:23,869 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:02:23,899 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2024-02-19 15:02:23,902 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:02:23,918 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:02:23,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23 WrapperNode [2024-02-19 15:02:23,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:02:23,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:02:23,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:02:23,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:02:23,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:23,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:23,961 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2024-02-19 15:02:23,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:02:23,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:02:23,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:02:23,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:02:23,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:23,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:23,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:24,007 INFO L175 MemorySlicer]: Split 15 memory accesses to 5 slices as follows [2, 2, 2, 2, 7]. 47 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-19 15:02:24,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:24,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:24,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:24,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:24,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:24,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:24,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:02:24,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:02:24,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:02:24,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:02:24,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (1/1) ... [2024-02-19 15:02:24,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:02:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:24,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:02:24,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:02:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:02:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:02:24,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:02:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:02:24,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:02:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:02:24,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 15:02:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:02:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 15:02:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:02:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:02:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:02:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:02:24,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:02:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:02:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:02:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:02:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:02:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 15:02:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:02:24,170 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:02:24,294 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:02:24,296 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:02:24,500 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:02:24,500 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:02:24,641 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:02:24,642 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 15:02:24,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:02:24 BoogieIcfgContainer [2024-02-19 15:02:24,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:02:24,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:02:24,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:02:24,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:02:24,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:02:23" (1/3) ... [2024-02-19 15:02:24,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2909868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:02:24, skipping insertion in model container [2024-02-19 15:02:24,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:02:23" (2/3) ... [2024-02-19 15:02:24,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2909868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:02:24, skipping insertion in model container [2024-02-19 15:02:24,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:02:24" (3/3) ... [2024-02-19 15:02:24,647 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2024-02-19 15:02:24,667 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:02:24,667 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:02:24,667 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:02:24,713 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:02:24,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 91 flow [2024-02-19 15:02:24,781 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2024-02-19 15:02:24,784 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:02:24,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 4/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-02-19 15:02:24,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 91 flow [2024-02-19 15:02:24,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 80 flow [2024-02-19 15:02:24,805 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:02:24,811 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;@5ae163e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:02:24,811 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:02:24,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:02:24,828 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-02-19 15:02:24,828 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:02:24,828 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:24,829 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] [2024-02-19 15:02:24,830 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:24,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 440371353, now seen corresponding path program 1 times [2024-02-19 15:02:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:24,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576433179] [2024-02-19 15:02:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:25,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576433179] [2024-02-19 15:02:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576433179] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:02:25,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:02:25,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:02:25,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114603318] [2024-02-19 15:02:25,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:02:25,151 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:02:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:25,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:02:25,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:02:25,172 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-02-19 15:02:25,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:25,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:25,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-02-19 15:02:25,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:25,323 INFO L124 PetriNetUnfolderBase]: 655/1008 cut-off events. [2024-02-19 15:02:25,324 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-02-19 15:02:25,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 1008 events. 655/1008 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4385 event pairs, 93 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 1605. Up to 822 conditions per place. [2024-02-19 15:02:25,331 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2024-02-19 15:02:25,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 207 flow [2024-02-19 15:02:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:02:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:02:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-02-19 15:02:25,340 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-02-19 15:02:25,343 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2024-02-19 15:02:25,343 INFO L507 AbstractCegarLoop]: Abstraction has has 39 places, 47 transitions, 207 flow [2024-02-19 15:02:25,344 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:25,344 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:25,344 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:25,344 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:02:25,344 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:25,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1717670322, now seen corresponding path program 1 times [2024-02-19 15:02:25,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:25,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13184753] [2024-02-19 15:02:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13184753] [2024-02-19 15:02:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13184753] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:02:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:02:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:02:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124778096] [2024-02-19 15:02:25,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:02:25,486 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:02:25,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:25,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:02:25,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:02:25,490 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-02-19 15:02:25,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 47 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:25,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:25,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-02-19 15:02:25,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:25,632 INFO L124 PetriNetUnfolderBase]: 655/1009 cut-off events. [2024-02-19 15:02:25,632 INFO L125 PetriNetUnfolderBase]: For 192/224 co-relation queries the response was YES. [2024-02-19 15:02:25,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2899 conditions, 1009 events. 655/1009 cut-off events. For 192/224 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4429 event pairs, 93 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 2338. Up to 903 conditions per place. [2024-02-19 15:02:25,639 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 38 selfloop transitions, 2 changer transitions 1/48 dead transitions. [2024-02-19 15:02:25,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 293 flow [2024-02-19 15:02:25,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:02:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:02:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-19 15:02:25,642 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-19 15:02:25,643 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2024-02-19 15:02:25,643 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 48 transitions, 293 flow [2024-02-19 15:02:25,644 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:25,644 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:25,644 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:25,644 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:02:25,645 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:25,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:25,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1069321185, now seen corresponding path program 1 times [2024-02-19 15:02:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:25,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186420258] [2024-02-19 15:02:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:02:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186420258] [2024-02-19 15:02:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186420258] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:02:25,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:02:25,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:02:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144261395] [2024-02-19 15:02:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:02:25,797 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:02:25,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:25,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:02:25,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:02:25,810 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-19 15:02:25,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 48 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-19 15:02:25,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:25,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-19 15:02:25,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:25,983 INFO L124 PetriNetUnfolderBase]: 868/1257 cut-off events. [2024-02-19 15:02:25,983 INFO L125 PetriNetUnfolderBase]: For 1309/1357 co-relation queries the response was YES. [2024-02-19 15:02:25,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 1257 events. 868/1257 cut-off events. For 1309/1357 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5497 event pairs, 69 based on Foata normal form. 54/1301 useless extension candidates. Maximal degree in co-relation 3777. Up to 1061 conditions per place. [2024-02-19 15:02:25,992 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 58 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-02-19 15:02:25,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 536 flow [2024-02-19 15:02:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:02:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:02:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-02-19 15:02:25,994 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-02-19 15:02:25,995 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2024-02-19 15:02:25,995 INFO L507 AbstractCegarLoop]: Abstraction has has 44 places, 67 transitions, 536 flow [2024-02-19 15:02:25,995 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-19 15:02:25,995 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:25,995 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:25,996 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:02:25,996 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:25,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 721954181, now seen corresponding path program 1 times [2024-02-19 15:02:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326909286] [2024-02-19 15:02:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:26,071 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-19 15:02:26,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:26,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326909286] [2024-02-19 15:02:26,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326909286] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:26,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440509117] [2024-02-19 15:02:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:26,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:26,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:02:26,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 15:02:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:26,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:02:26,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:26,228 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-19 15:02:26,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440509117] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:26,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:02:26,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-19 15:02:26,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680794033] [2024-02-19 15:02:26,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:02:26,255 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:02:26,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:26,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:02:26,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:02:26,261 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-19 15:02:26,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 67 transitions, 536 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:26,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:26,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-19 15:02:26,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:26,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (<= v_~M~0_51 v_thread2Thread1of1ForFork2_~i~1_5)) InVars {~M~0=v_~M~0_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, ~M~0=v_~M~0_51, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][62], [24#L70-4true, 4#L47true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 35#L95-1true, 47#true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 6#thread2EXITtrue, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,379 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-19 15:02:26,379 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 15:02:26,379 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 15:02:26,379 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 15:02:26,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L59-->L63: Formula: (let ((.cse0 (select (select |v_#memory_int#4_45| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread2Thread1of1ForFork2_~i~1_7 4))))) (or (and (= v_~min2~0_47 .cse0) (< .cse0 v_~min2~0_48)) (and (= |v_thread2Thread1of1ForFork2_#t~mem6_2| |v_thread2Thread1of1ForFork2_#t~mem6_1|) (= v_~min2~0_48 v_~min2~0_47) (<= v_~min2~0_48 .cse0)))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_2|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_1|, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem5, ~min2~0][59], [5#L94-4true, 4#L47true, 18#L71true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 47#true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 13#L63true, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,380 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,380 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,380 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,380 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L59-->L63: Formula: (let ((.cse0 (select (select |v_#memory_int#4_45| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread2Thread1of1ForFork2_~i~1_7 4))))) (or (and (= v_~min2~0_47 .cse0) (< .cse0 v_~min2~0_48)) (and (= |v_thread2Thread1of1ForFork2_#t~mem6_2| |v_thread2Thread1of1ForFork2_#t~mem6_1|) (= v_~min2~0_48 v_~min2~0_47) (<= v_~min2~0_48 .cse0)))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_2|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_1|, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem5, ~min2~0][59], [4#L47true, 18#L71true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 35#L95-1true, 47#true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 13#L63true, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,382 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,382 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,382 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,382 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (<= v_~M~0_51 v_thread2Thread1of1ForFork2_~i~1_5)) InVars {~M~0=v_~M~0_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, ~M~0=v_~M~0_51, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][62], [4#L47true, 18#L71true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 35#L95-1true, 47#true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 6#thread2EXITtrue, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,383 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,383 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,383 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,383 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (<= v_~M~0_51 v_thread2Thread1of1ForFork2_~i~1_5)) InVars {~M~0=v_~M~0_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, ~M~0=v_~M~0_51, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][62], [18#L71true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 35#L95-1true, 47#true, 31#L46-4true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 6#thread2EXITtrue, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,385 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-02-19 15:02:26,385 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 15:02:26,385 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 15:02:26,385 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 15:02:26,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (<= v_~M~0_51 v_thread2Thread1of1ForFork2_~i~1_5)) InVars {~M~0=v_~M~0_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, ~M~0=v_~M~0_51, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][62], [5#L94-4true, 4#L47true, 18#L71true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 47#true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 6#thread2EXITtrue, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,392 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-02-19 15:02:26,392 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-19 15:02:26,392 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-19 15:02:26,392 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-02-19 15:02:26,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L59-->L63: Formula: (let ((.cse0 (select (select |v_#memory_int#4_45| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread2Thread1of1ForFork2_~i~1_7 4))))) (or (and (= v_~min2~0_47 .cse0) (< .cse0 v_~min2~0_48)) (and (= |v_thread2Thread1of1ForFork2_#t~mem6_2| |v_thread2Thread1of1ForFork2_#t~mem6_1|) (= v_~min2~0_48 v_~min2~0_47) (<= v_~min2~0_48 .cse0)))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_2|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_1|, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem5, ~min2~0][59], [24#L70-4true, 4#L47true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 35#L95-1true, 47#true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 13#L63true, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,393 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,393 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,393 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,393 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,394 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([435] L59-->L63: Formula: (let ((.cse0 (select (select |v_#memory_int#4_45| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread2Thread1of1ForFork2_~i~1_7 4))))) (or (and (= v_~min2~0_47 .cse0) (< .cse0 v_~min2~0_48)) (and (= |v_thread2Thread1of1ForFork2_#t~mem6_2| |v_thread2Thread1of1ForFork2_#t~mem6_1|) (= v_~min2~0_48 v_~min2~0_47) (<= v_~min2~0_48 .cse0)))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_2|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_1|, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem5, ~min2~0][59], [4#L47true, 18#L71true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 35#L95-1true, 47#true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 13#L63true, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,394 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,394 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,394 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,394 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,394 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 15:02:26,395 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([434] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (<= v_~M~0_51 v_thread2Thread1of1ForFork2_~i~1_5)) InVars {~M~0=v_~M~0_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, ~M~0=v_~M~0_51, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][62], [4#L47true, 18#L71true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 35#L95-1true, 47#true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 6#thread2EXITtrue, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,395 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,395 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,395 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,395 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,395 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L59-->L63: Formula: (let ((.cse0 (select (select |v_#memory_int#4_45| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread2Thread1of1ForFork2_~i~1_7 4))))) (or (and (= v_~min2~0_47 .cse0) (< .cse0 v_~min2~0_48)) (and (= |v_thread2Thread1of1ForFork2_#t~mem6_2| |v_thread2Thread1of1ForFork2_#t~mem6_1|) (= v_~min2~0_48 v_~min2~0_47) (<= v_~min2~0_48 .cse0)))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_2|, ~A~0.base=v_~A~0.base_63, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, ~A~0.offset=v_~A~0.offset_63, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_1|, #memory_int#4=|v_#memory_int#4_45|, ~min2~0=v_~min2~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem5, ~min2~0][59], [18#L71true, 44#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 35#L95-1true, 210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 47#true, 31#L46-4true, 13#L63true, thread2Thread1of1ForFork2InUse, 55#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= (+ ~M~0 1) ~N~0))]) [2024-02-19 15:02:26,398 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,398 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,398 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,398 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 15:02:26,443 INFO L124 PetriNetUnfolderBase]: 1130/1607 cut-off events. [2024-02-19 15:02:26,443 INFO L125 PetriNetUnfolderBase]: For 4245/4348 co-relation queries the response was YES. [2024-02-19 15:02:26,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7120 conditions, 1607 events. 1130/1607 cut-off events. For 4245/4348 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7003 event pairs, 102 based on Foata normal form. 125/1704 useless extension candidates. Maximal degree in co-relation 6829. Up to 1276 conditions per place. [2024-02-19 15:02:26,452 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 72 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2024-02-19 15:02:26,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 822 flow [2024-02-19 15:02:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:02:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:02:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-02-19 15:02:26,454 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-02-19 15:02:26,461 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2024-02-19 15:02:26,462 INFO L507 AbstractCegarLoop]: Abstraction has has 48 places, 84 transitions, 822 flow [2024-02-19 15:02:26,462 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:26,462 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:26,462 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:26,489 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-19 15:02:26,673 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:26,674 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:26,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash 676449730, now seen corresponding path program 1 times [2024-02-19 15:02:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:26,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888856443] [2024-02-19 15:02:26,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:26,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:27,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:27,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888856443] [2024-02-19 15:02:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888856443] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569130969] [2024-02-19 15:02:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:27,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:27,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:27,258 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-19 15:02:27,260 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-19 15:02:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:27,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2024-02-19 15:02:27,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:27,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:02:27,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-02-19 15:02:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:27,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:28,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2024-02-19 15:02:28,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:28,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2024-02-19 15:02:29,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2024-02-19 15:02:29,078 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-02-19 15:02:29,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2024-02-19 15:02:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569130969] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:29,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-02-19 15:02:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101205585] [2024-02-19 15:02:29,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:29,355 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 15:02:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:29,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 15:02:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-02-19 15:02:29,511 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-19 15:02:29,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 84 transitions, 822 flow. Second operand has 23 states, 23 states have (on average 10.73913043478261) internal successors, (247), 23 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:29,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:29,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-19 15:02:29,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:30,392 INFO L124 PetriNetUnfolderBase]: 1689/2443 cut-off events. [2024-02-19 15:02:30,393 INFO L125 PetriNetUnfolderBase]: For 6943/7039 co-relation queries the response was YES. [2024-02-19 15:02:30,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12931 conditions, 2443 events. 1689/2443 cut-off events. For 6943/7039 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11265 event pairs, 115 based on Foata normal form. 25/2434 useless extension candidates. Maximal degree in co-relation 10146. Up to 1934 conditions per place. [2024-02-19 15:02:30,414 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 169 selfloop transitions, 65 changer transitions 1/242 dead transitions. [2024-02-19 15:02:30,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 242 transitions, 2902 flow [2024-02-19 15:02:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 15:02:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 15:02:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 255 transitions. [2024-02-19 15:02:30,418 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-02-19 15:02:30,419 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2024-02-19 15:02:30,420 INFO L507 AbstractCegarLoop]: Abstraction has has 62 places, 242 transitions, 2902 flow [2024-02-19 15:02:30,420 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.73913043478261) internal successors, (247), 23 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:30,420 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:30,422 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:30,449 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-19 15:02:30,635 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:30,635 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:30,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -229890622, now seen corresponding path program 2 times [2024-02-19 15:02:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850303782] [2024-02-19 15:02:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850303782] [2024-02-19 15:02:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850303782] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722652609] [2024-02-19 15:02:31,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:02:31,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:31,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:31,053 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-19 15:02:31,054 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-19 15:02:31,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:02:31,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:31,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2024-02-19 15:02:31,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:31,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:02:31,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-02-19 15:02:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:31,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:32,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-02-19 15:02:32,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2024-02-19 15:02:32,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-02-19 15:02:32,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2024-02-19 15:02:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:32,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722652609] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:32,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2024-02-19 15:02:32,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889024520] [2024-02-19 15:02:32,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:32,086 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-02-19 15:02:32,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:32,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-02-19 15:02:32,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2024-02-19 15:02:32,171 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:02:32,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 242 transitions, 2902 flow. Second operand has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:32,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:32,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:02:32,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:34,194 INFO L124 PetriNetUnfolderBase]: 4363/6275 cut-off events. [2024-02-19 15:02:34,195 INFO L125 PetriNetUnfolderBase]: For 22762/22812 co-relation queries the response was YES. [2024-02-19 15:02:34,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36048 conditions, 6275 events. 4363/6275 cut-off events. For 22762/22812 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 30937 event pairs, 240 based on Foata normal form. 1/6189 useless extension candidates. Maximal degree in co-relation 26727. Up to 4368 conditions per place. [2024-02-19 15:02:34,251 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 406 selfloop transitions, 184 changer transitions 2/595 dead transitions. [2024-02-19 15:02:34,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 595 transitions, 7758 flow [2024-02-19 15:02:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-02-19 15:02:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-02-19 15:02:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 495 transitions. [2024-02-19 15:02:34,255 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40408163265306124 [2024-02-19 15:02:34,257 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-02-19 15:02:34,257 INFO L507 AbstractCegarLoop]: Abstraction has has 96 places, 595 transitions, 7758 flow [2024-02-19 15:02:34,257 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:34,257 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:34,258 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:34,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:02:34,471 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:34,471 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:34,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1319147060, now seen corresponding path program 3 times [2024-02-19 15:02:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24279754] [2024-02-19 15:02:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:34,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:34,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24279754] [2024-02-19 15:02:34,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24279754] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571662194] [2024-02-19 15:02:34,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:02:34,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:34,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:34,857 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-19 15:02:34,886 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-19 15:02:34,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:02:34,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:34,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjunts are in the unsatisfiable core [2024-02-19 15:02:34,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:34,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:02:35,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-02-19 15:02:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:35,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:35,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2024-02-19 15:02:35,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:35,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 111 [2024-02-19 15:02:36,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2024-02-19 15:02:36,429 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-02-19 15:02:36,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2024-02-19 15:02:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571662194] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:36,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:36,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-02-19 15:02:36,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388310310] [2024-02-19 15:02:36,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:36,450 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 15:02:36,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:36,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 15:02:36,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-02-19 15:02:36,580 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-02-19 15:02:36,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 595 transitions, 7758 flow. Second operand has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 21 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:36,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:36,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-02-19 15:02:36,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:38,707 INFO L124 PetriNetUnfolderBase]: 5801/8359 cut-off events. [2024-02-19 15:02:38,707 INFO L125 PetriNetUnfolderBase]: For 37560/37618 co-relation queries the response was YES. [2024-02-19 15:02:38,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55202 conditions, 8359 events. 5801/8359 cut-off events. For 37560/37618 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 43589 event pairs, 276 based on Foata normal form. 1/8257 useless extension candidates. Maximal degree in co-relation 44052. Up to 5930 conditions per place. [2024-02-19 15:02:38,775 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 622 selfloop transitions, 142 changer transitions 5/810 dead transitions. [2024-02-19 15:02:38,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 810 transitions, 12263 flow [2024-02-19 15:02:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-19 15:02:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-19 15:02:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 312 transitions. [2024-02-19 15:02:38,777 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4691729323308271 [2024-02-19 15:02:38,777 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 77 predicate places. [2024-02-19 15:02:38,777 INFO L507 AbstractCegarLoop]: Abstraction has has 114 places, 810 transitions, 12263 flow [2024-02-19 15:02:38,777 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 21 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:38,778 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:38,778 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:38,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-19 15:02:38,989 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:38,989 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:38,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1810590486, now seen corresponding path program 4 times [2024-02-19 15:02:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640381638] [2024-02-19 15:02:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:39,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640381638] [2024-02-19 15:02:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640381638] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20175537] [2024-02-19 15:02:39,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:02:39,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:39,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:39,388 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-19 15:02:39,395 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-19 15:02:39,470 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:02:39,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:39,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2024-02-19 15:02:39,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:39,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:02:39,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-02-19 15:02:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:39,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:40,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2024-02-19 15:02:40,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:40,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 111 [2024-02-19 15:02:40,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2024-02-19 15:02:40,866 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-02-19 15:02:40,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2024-02-19 15:02:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:40,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20175537] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:40,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:40,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-02-19 15:02:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725155563] [2024-02-19 15:02:40,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:40,892 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-02-19 15:02:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:40,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-02-19 15:02:40,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-02-19 15:02:41,024 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-02-19 15:02:41,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 810 transitions, 12263 flow. Second operand has 24 states, 24 states have (on average 9.75) internal successors, (234), 24 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:41,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:41,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-02-19 15:02:41,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:42,984 INFO L124 PetriNetUnfolderBase]: 6500/9421 cut-off events. [2024-02-19 15:02:42,984 INFO L125 PetriNetUnfolderBase]: For 54670/54720 co-relation queries the response was YES. [2024-02-19 15:02:42,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70383 conditions, 9421 events. 6500/9421 cut-off events. For 54670/54720 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 50903 event pairs, 260 based on Foata normal form. 1/9335 useless extension candidates. Maximal degree in co-relation 55770. Up to 6761 conditions per place. [2024-02-19 15:02:43,066 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 800 selfloop transitions, 130 changer transitions 7/978 dead transitions. [2024-02-19 15:02:43,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 978 transitions, 16820 flow [2024-02-19 15:02:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-19 15:02:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-19 15:02:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 281 transitions. [2024-02-19 15:02:43,068 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44603174603174606 [2024-02-19 15:02:43,068 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 94 predicate places. [2024-02-19 15:02:43,068 INFO L507 AbstractCegarLoop]: Abstraction has has 131 places, 978 transitions, 16820 flow [2024-02-19 15:02:43,069 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.75) internal successors, (234), 24 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:43,069 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:43,069 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:43,096 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-19 15:02:43,280 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:43,281 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:43,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1432346282, now seen corresponding path program 5 times [2024-02-19 15:02:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:43,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684129841] [2024-02-19 15:02:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:43,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:43,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684129841] [2024-02-19 15:02:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684129841] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:43,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181807246] [2024-02-19 15:02:43,709 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:02:43,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:43,711 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-19 15:02:43,712 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-19 15:02:43,788 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:02:43,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:43,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2024-02-19 15:02:43,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:43,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:02:44,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-02-19 15:02:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:44,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:44,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2024-02-19 15:02:44,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:44,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2024-02-19 15:02:45,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2024-02-19 15:02:45,088 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:02:45,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2024-02-19 15:02:45,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2024-02-19 15:02:45,097 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:02:45,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2024-02-19 15:02:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181807246] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:45,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:45,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2024-02-19 15:02:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188001707] [2024-02-19 15:02:45,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:45,122 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-02-19 15:02:45,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-02-19 15:02:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2024-02-19 15:02:45,259 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-02-19 15:02:45,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 978 transitions, 16820 flow. Second operand has 27 states, 27 states have (on average 9.518518518518519) internal successors, (257), 27 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:45,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:45,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-02-19 15:02:45,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:48,068 INFO L124 PetriNetUnfolderBase]: 6968/10100 cut-off events. [2024-02-19 15:02:48,069 INFO L125 PetriNetUnfolderBase]: For 72088/72138 co-relation queries the response was YES. [2024-02-19 15:02:48,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84158 conditions, 10100 events. 6968/10100 cut-off events. For 72088/72138 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 55199 event pairs, 275 based on Foata normal form. 2/10015 useless extension candidates. Maximal degree in co-relation 64892. Up to 7296 conditions per place. [2024-02-19 15:02:48,145 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 787 selfloop transitions, 285 changer transitions 10/1123 dead transitions. [2024-02-19 15:02:48,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1123 transitions, 21556 flow [2024-02-19 15:02:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-19 15:02:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-19 15:02:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 367 transitions. [2024-02-19 15:02:48,147 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45590062111801244 [2024-02-19 15:02:48,148 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 116 predicate places. [2024-02-19 15:02:48,148 INFO L507 AbstractCegarLoop]: Abstraction has has 153 places, 1123 transitions, 21556 flow [2024-02-19 15:02:48,148 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.518518518518519) internal successors, (257), 27 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:48,148 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:48,148 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:48,160 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-19 15:02:48,360 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:48,360 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:48,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:48,361 INFO L85 PathProgramCache]: Analyzing trace with hash -280790907, now seen corresponding path program 6 times [2024-02-19 15:02:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693892088] [2024-02-19 15:02:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:48,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693892088] [2024-02-19 15:02:48,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693892088] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:48,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136679019] [2024-02-19 15:02:48,433 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:02:48,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:48,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:48,434 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-19 15:02:48,461 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-19 15:02:48,514 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-02-19 15:02:48,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:48,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:02:48,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:48,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136679019] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:48,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-02-19 15:02:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504346705] [2024-02-19 15:02:48,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:48,695 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:02:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:02:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:02:48,708 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:02:48,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 1123 transitions, 21556 flow. Second operand has 19 states, 19 states have (on average 6.894736842105263) internal successors, (131), 19 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:48,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:48,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:02:48,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:53,773 INFO L124 PetriNetUnfolderBase]: 15238/21669 cut-off events. [2024-02-19 15:02:53,773 INFO L125 PetriNetUnfolderBase]: For 151143/151143 co-relation queries the response was YES. [2024-02-19 15:02:53,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200754 conditions, 21669 events. 15238/21669 cut-off events. For 151143/151143 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 124585 event pairs, 160 based on Foata normal form. 322/21989 useless extension candidates. Maximal degree in co-relation 108746. Up to 15545 conditions per place. [2024-02-19 15:02:53,953 INFO L140 encePairwiseOnDemand]: 19/35 looper letters, 2642 selfloop transitions, 961 changer transitions 9/3613 dead transitions. [2024-02-19 15:02:53,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 3613 transitions, 73776 flow [2024-02-19 15:02:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-02-19 15:02:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2024-02-19 15:02:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 1084 transitions. [2024-02-19 15:02:53,957 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4022263450834879 [2024-02-19 15:02:53,957 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 192 predicate places. [2024-02-19 15:02:53,957 INFO L507 AbstractCegarLoop]: Abstraction has has 229 places, 3613 transitions, 73776 flow [2024-02-19 15:02:53,957 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.894736842105263) internal successors, (131), 19 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:53,957 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:53,957 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:53,979 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-19 15:02:54,169 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:54,170 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:02:54,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash 844515521, now seen corresponding path program 7 times [2024-02-19 15:02:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120671456] [2024-02-19 15:02:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120671456] [2024-02-19 15:02:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120671456] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256030633] [2024-02-19 15:02:54,260 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:02:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:54,261 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-19 15:02:54,286 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-19 15:02:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:54,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:02:54,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:54,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256030633] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:54,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:54,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-02-19 15:02:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358689772] [2024-02-19 15:02:54,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:54,506 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:02:54,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:54,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:02:54,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:02:54,540 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-19 15:02:54,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 3613 transitions, 73776 flow. Second operand has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:02:54,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:54,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-19 15:02:54,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:03:01,341 INFO L124 PetriNetUnfolderBase]: 13128/19001 cut-off events. [2024-02-19 15:03:01,341 INFO L125 PetriNetUnfolderBase]: For 161044/161044 co-relation queries the response was YES. [2024-02-19 15:03:01,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192800 conditions, 19001 events. 13128/19001 cut-off events. For 161044/161044 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 111033 event pairs, 172 based on Foata normal form. 788/19787 useless extension candidates. Maximal degree in co-relation 95804. Up to 13824 conditions per place. [2024-02-19 15:03:01,518 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 2880 selfloop transitions, 207 changer transitions 73/3457 dead transitions. [2024-02-19 15:03:01,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 3457 transitions, 77840 flow [2024-02-19 15:03:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:03:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:03:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-02-19 15:03:01,520 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-02-19 15:03:01,520 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 198 predicate places. [2024-02-19 15:03:01,521 INFO L507 AbstractCegarLoop]: Abstraction has has 235 places, 3457 transitions, 77840 flow [2024-02-19 15:03:01,521 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.714285714285714) internal successors, (164), 14 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:01,521 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:03:01,521 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:03:01,532 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-19 15:03:01,732 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,SelfDestructingSolverStorable10 [2024-02-19 15:03:01,733 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:03:01,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:03:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1398497023, now seen corresponding path program 8 times [2024-02-19 15:03:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:03:01,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4248829] [2024-02-19 15:03:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:03:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:03:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:03:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:03:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:03:01,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4248829] [2024-02-19 15:03:01,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4248829] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:03:01,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120142353] [2024-02-19 15:03:01,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:03:01,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:03:01,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:03:01,982 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-19 15:03:01,984 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-19 15:03:02,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:03:02,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:03:02,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:03:02,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:03:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:03:02,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:03:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:03:02,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120142353] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:03:02,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:03:02,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-02-19 15:03:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31932755] [2024-02-19 15:03:02,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:03:02,143 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:03:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:03:02,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:03:02,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:03:02,161 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-19 15:03:02,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 3457 transitions, 77840 flow. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:02,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:03:02,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-19 15:03:02,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:03:09,617 INFO L124 PetriNetUnfolderBase]: 11692/17121 cut-off events. [2024-02-19 15:03:09,617 INFO L125 PetriNetUnfolderBase]: For 149315/149315 co-relation queries the response was YES. [2024-02-19 15:03:09,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190773 conditions, 17121 events. 11692/17121 cut-off events. For 149315/149315 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 100183 event pairs, 148 based on Foata normal form. 458/17577 useless extension candidates. Maximal degree in co-relation 103640. Up to 12704 conditions per place. [2024-02-19 15:03:09,922 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 2705 selfloop transitions, 205 changer transitions 200/3424 dead transitions. [2024-02-19 15:03:09,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 3424 transitions, 83529 flow [2024-02-19 15:03:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:03:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:03:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-02-19 15:03:09,923 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-02-19 15:03:09,924 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 204 predicate places. [2024-02-19 15:03:09,924 INFO L507 AbstractCegarLoop]: Abstraction has has 241 places, 3424 transitions, 83529 flow [2024-02-19 15:03:09,924 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:09,925 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:03:09,925 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:03:09,936 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-19 15:03:10,136 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:03:10,136 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:03:10,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:03:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1167908556, now seen corresponding path program 1 times [2024-02-19 15:03:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:03:10,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841679691] [2024-02-19 15:03:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:03:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:03:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:03:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:03:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:03:10,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841679691] [2024-02-19 15:03:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841679691] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:03:10,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865909491] [2024-02-19 15:03:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:03:10,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:03:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:03:10,243 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-19 15:03:10,266 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-19 15:03:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:03:10,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:03:10,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:03:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:03:10,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:03:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:03:10,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865909491] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:03:10,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:03:10,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-02-19 15:03:10,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578285849] [2024-02-19 15:03:10,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:03:10,429 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 15:03:10,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:03:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 15:03:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-02-19 15:03:10,472 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-19 15:03:10,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 3424 transitions, 83529 flow. Second operand has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:10,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:03:10,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-19 15:03:10,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:03:16,109 INFO L124 PetriNetUnfolderBase]: 8358/12298 cut-off events. [2024-02-19 15:03:16,110 INFO L125 PetriNetUnfolderBase]: For 116570/116570 co-relation queries the response was YES. [2024-02-19 15:03:16,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145503 conditions, 12298 events. 8358/12298 cut-off events. For 116570/116570 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 68500 event pairs, 138 based on Foata normal form. 330/12626 useless extension candidates. Maximal degree in co-relation 110950. Up to 9100 conditions per place. [2024-02-19 15:03:16,229 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 1303 selfloop transitions, 3 changer transitions 982/2528 dead transitions. [2024-02-19 15:03:16,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 2528 transitions, 65713 flow [2024-02-19 15:03:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:03:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:03:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-02-19 15:03:16,230 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-02-19 15:03:16,231 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 203 predicate places. [2024-02-19 15:03:16,231 INFO L507 AbstractCegarLoop]: Abstraction has has 240 places, 2528 transitions, 65713 flow [2024-02-19 15:03:16,231 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:16,231 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:03:16,231 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:03:16,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-19 15:03:16,443 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,SelfDestructingSolverStorable12 [2024-02-19 15:03:16,443 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:03:16,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:03:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1531182036, now seen corresponding path program 9 times [2024-02-19 15:03:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:03:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633362284] [2024-02-19 15:03:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:03:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:03:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:03:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:03:16,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:03:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633362284] [2024-02-19 15:03:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633362284] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:03:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627727907] [2024-02-19 15:03:16,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:03:16,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:03:16,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:03:16,687 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-19 15:03:16,713 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-19 15:03:16,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:03:16,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:03:16,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:03:16,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:03:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:03:16,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:03:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:03:16,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627727907] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:03:16,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:03:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-02-19 15:03:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783630208] [2024-02-19 15:03:16,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:03:16,944 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-19 15:03:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:03:16,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-19 15:03:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-02-19 15:03:16,990 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-02-19 15:03:16,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 2528 transitions, 65713 flow. Second operand has 18 states, 18 states have (on average 8.5) internal successors, (153), 18 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:16,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:03:16,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-02-19 15:03:16,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:03:22,819 INFO L124 PetriNetUnfolderBase]: 11198/16353 cut-off events. [2024-02-19 15:03:22,819 INFO L125 PetriNetUnfolderBase]: For 169305/169305 co-relation queries the response was YES. [2024-02-19 15:03:22,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209662 conditions, 16353 events. 11198/16353 cut-off events. For 169305/169305 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 92549 event pairs, 154 based on Foata normal form. 40/16391 useless extension candidates. Maximal degree in co-relation 171584. Up to 12686 conditions per place. [2024-02-19 15:03:22,994 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 1709 selfloop transitions, 385 changer transitions 982/3196 dead transitions. [2024-02-19 15:03:22,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 3196 transitions, 89871 flow [2024-02-19 15:03:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 15:03:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 15:03:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 234 transitions. [2024-02-19 15:03:22,995 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-02-19 15:03:22,996 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 216 predicate places. [2024-02-19 15:03:22,996 INFO L507 AbstractCegarLoop]: Abstraction has has 253 places, 3196 transitions, 89871 flow [2024-02-19 15:03:22,996 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.5) internal successors, (153), 18 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:22,996 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:03:22,996 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:03:23,008 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-19 15:03:23,207 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,SelfDestructingSolverStorable13 [2024-02-19 15:03:23,208 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:03:23,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:03:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2144621326, now seen corresponding path program 10 times [2024-02-19 15:03:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:03:23,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421832563] [2024-02-19 15:03:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:03:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:03:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:03:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:03:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:03:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421832563] [2024-02-19 15:03:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421832563] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:03:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362555527] [2024-02-19 15:03:23,486 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:03:23,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:03:23,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:03:23,487 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-19 15:03:23,489 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-19 15:03:23,565 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:03:23,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:03:23,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:03:23,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:03:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:03:23,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:03:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:03:23,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362555527] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:03:23,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:03:23,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-02-19 15:03:23,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782114770] [2024-02-19 15:03:23,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:03:23,705 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:03:23,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:03:23,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:03:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:03:23,755 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:03:23,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 3196 transitions, 89871 flow. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:23,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:03:23,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:03:23,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:03:35,050 INFO L124 PetriNetUnfolderBase]: 14701/21288 cut-off events. [2024-02-19 15:03:35,050 INFO L125 PetriNetUnfolderBase]: For 199844/199844 co-relation queries the response was YES. [2024-02-19 15:03:35,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294505 conditions, 21288 events. 14701/21288 cut-off events. For 199844/199844 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 120900 event pairs, 101 based on Foata normal form. 20/21306 useless extension candidates. Maximal degree in co-relation 252964. Up to 16937 conditions per place. [2024-02-19 15:03:35,264 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 2785 selfloop transitions, 1087 changer transitions 993/4866 dead transitions. [2024-02-19 15:03:35,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 4866 transitions, 145036 flow [2024-02-19 15:03:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-02-19 15:03:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2024-02-19 15:03:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 578 transitions. [2024-02-19 15:03:35,266 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3840531561461794 [2024-02-19 15:03:35,267 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 258 predicate places. [2024-02-19 15:03:35,267 INFO L507 AbstractCegarLoop]: Abstraction has has 295 places, 4866 transitions, 145036 flow [2024-02-19 15:03:35,267 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:35,268 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:03:35,269 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:03:35,280 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-19 15:03:35,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,SelfDestructingSolverStorable14 [2024-02-19 15:03:35,473 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:03:35,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:03:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash -126764400, now seen corresponding path program 11 times [2024-02-19 15:03:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:03:35,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834590076] [2024-02-19 15:03:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:03:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:03:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:03:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:03:35,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:03:35,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834590076] [2024-02-19 15:03:35,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834590076] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:03:35,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906130980] [2024-02-19 15:03:35,556 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:03:35,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:03:35,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:03:35,564 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-19 15:03:35,565 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-19 15:03:35,668 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:03:35,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:03:35,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:03:35,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:03:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:03:35,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:03:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:03:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906130980] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:03:35,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:03:35,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-02-19 15:03:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253213566] [2024-02-19 15:03:35,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:03:35,825 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:03:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:03:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:03:35,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:03:35,845 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:03:35,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 4866 transitions, 145036 flow. Second operand has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:03:35,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:03:35,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:03:35,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:04:08,215 INFO L124 PetriNetUnfolderBase]: 23984/34172 cut-off events. [2024-02-19 15:04:08,216 INFO L125 PetriNetUnfolderBase]: For 299707/299707 co-relation queries the response was YES. [2024-02-19 15:04:08,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508428 conditions, 34172 events. 23984/34172 cut-off events. For 299707/299707 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 199017 event pairs, 103 based on Foata normal form. 40/34210 useless extension candidates. Maximal degree in co-relation 461265. Up to 27966 conditions per place. [2024-02-19 15:04:08,626 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 4178 selfloop transitions, 1973 changer transitions 993/7145 dead transitions. [2024-02-19 15:04:08,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 7145 transitions, 225219 flow [2024-02-19 15:04:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-02-19 15:04:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2024-02-19 15:04:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 1683 transitions. [2024-02-19 15:04:08,630 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3974025974025974 [2024-02-19 15:04:08,630 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 375 predicate places. [2024-02-19 15:04:08,630 INFO L507 AbstractCegarLoop]: Abstraction has has 412 places, 7145 transitions, 225219 flow [2024-02-19 15:04:08,630 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:04:08,630 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:04:08,631 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:04:08,646 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-19 15:04:08,841 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,SelfDestructingSolverStorable15 [2024-02-19 15:04:08,841 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:04:08,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:04:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2143014238, now seen corresponding path program 12 times [2024-02-19 15:04:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:04:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879177756] [2024-02-19 15:04:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:04:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:04:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:04:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:04:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:04:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879177756] [2024-02-19 15:04:08,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879177756] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:04:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405396968] [2024-02-19 15:04:08,940 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:04:08,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:04:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:04:08,958 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:04:08,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-02-19 15:04:09,065 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-19 15:04:09,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:04:09,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:04:09,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:04:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:04:09,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:04:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:04:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405396968] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:04:09,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:04:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-02-19 15:04:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657090429] [2024-02-19 15:04:09,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:04:09,228 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:04:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:04:09,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:04:09,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:04:09,250 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:04:09,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 7145 transitions, 225219 flow. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:04:09,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:04:09,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:04:09,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:07,889 INFO L124 PetriNetUnfolderBase]: 24483/35014 cut-off events. [2024-02-19 15:05:07,890 INFO L125 PetriNetUnfolderBase]: For 304176/304176 co-relation queries the response was YES. [2024-02-19 15:05:07,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556507 conditions, 35014 events. 24483/35014 cut-off events. For 304176/304176 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 206757 event pairs, 111 based on Foata normal form. 22/35034 useless extension candidates. Maximal degree in co-relation 506214. Up to 28707 conditions per place. [2024-02-19 15:05:08,355 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 4600 selfloop transitions, 1816 changer transitions 993/7410 dead transitions. [2024-02-19 15:05:08,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 7410 transitions, 248564 flow [2024-02-19 15:05:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-02-19 15:05:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-02-19 15:05:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 630 transitions. [2024-02-19 15:05:08,358 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2024-02-19 15:05:08,358 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 420 predicate places. [2024-02-19 15:05:08,358 INFO L507 AbstractCegarLoop]: Abstraction has has 457 places, 7410 transitions, 248564 flow [2024-02-19 15:05:08,358 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:08,358 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:08,358 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:08,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-02-19 15:05:08,569 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:08,570 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:05:08,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash 128543296, now seen corresponding path program 13 times [2024-02-19 15:05:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:05:08,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060641503] [2024-02-19 15:05:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:05:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:05:08,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:05:08,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060641503] [2024-02-19 15:05:08,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060641503] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:05:08,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371817439] [2024-02-19 15:05:08,665 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:05:08,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:08,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:08,685 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:05:08,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-02-19 15:05:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:08,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:08,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:05:08,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:05:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371817439] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:08,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:05:08,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-02-19 15:05:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370767551] [2024-02-19 15:05:08,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:08,983 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-19 15:05:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:05:08,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-19 15:05:08,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-02-19 15:05:09,017 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-02-19 15:05:09,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 7410 transitions, 248564 flow. Second operand has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:09,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:09,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-02-19 15:05:09,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:28,280 INFO L124 PetriNetUnfolderBase]: 30634/43509 cut-off events. [2024-02-19 15:06:28,281 INFO L125 PetriNetUnfolderBase]: For 378534/378534 co-relation queries the response was YES. [2024-02-19 15:06:28,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730831 conditions, 43509 events. 30634/43509 cut-off events. For 378534/378534 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 260187 event pairs, 111 based on Foata normal form. 22/43529 useless extension candidates. Maximal degree in co-relation 675568. Up to 36036 conditions per place. [2024-02-19 15:06:28,856 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 5778 selfloop transitions, 1628 changer transitions 993/8868 dead transitions. [2024-02-19 15:06:28,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 8868 transitions, 315821 flow [2024-02-19 15:06:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-02-19 15:06:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-02-19 15:06:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 647 transitions. [2024-02-19 15:06:28,858 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4996138996138996 [2024-02-19 15:06:28,859 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 456 predicate places. [2024-02-19 15:06:28,859 INFO L507 AbstractCegarLoop]: Abstraction has has 493 places, 8868 transitions, 315821 flow [2024-02-19 15:06:28,859 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:28,859 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:28,859 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:28,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-02-19 15:06:29,070 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-02-19 15:06:29,071 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:06:29,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:29,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1985986364, now seen corresponding path program 14 times [2024-02-19 15:06:29,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:06:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581599013] [2024-02-19 15:06:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:06:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:06:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:06:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:06:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:06:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581599013] [2024-02-19 15:06:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581599013] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:06:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247049210] [2024-02-19 15:06:29,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:06:29,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:06:29,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:06:29,356 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:06:29,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-02-19 15:06:29,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:06:29,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:29,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:29,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:06:29,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:06:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247049210] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:29,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:06:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-02-19 15:06:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750227608] [2024-02-19 15:06:29,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:29,651 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-19 15:06:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:06:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-19 15:06:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-02-19 15:06:29,695 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-02-19 15:06:29,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 8868 transitions, 315821 flow. Second operand has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:06:29,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:29,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-02-19 15:06:29,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:08:13,439 INFO L124 PetriNetUnfolderBase]: 32189/45717 cut-off events. [2024-02-19 15:08:13,439 INFO L125 PetriNetUnfolderBase]: For 403559/403559 co-relation queries the response was YES. [2024-02-19 15:08:13,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809858 conditions, 45717 events. 32189/45717 cut-off events. For 403559/403559 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 275594 event pairs, 109 based on Foata normal form. 22/45737 useless extension candidates. Maximal degree in co-relation 751151. Up to 38028 conditions per place. [2024-02-19 15:08:14,138 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 5801 selfloop transitions, 2009 changer transitions 993/9272 dead transitions. [2024-02-19 15:08:14,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 9272 transitions, 348499 flow [2024-02-19 15:08:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-02-19 15:08:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-02-19 15:08:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 481 transitions. [2024-02-19 15:08:14,140 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49081632653061225 [2024-02-19 15:08:14,140 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 483 predicate places. [2024-02-19 15:08:14,141 INFO L507 AbstractCegarLoop]: Abstraction has has 520 places, 9272 transitions, 348499 flow [2024-02-19 15:08:14,141 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:08:14,141 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:08:14,141 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:08:14,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-02-19 15:08:14,352 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:08:14,353 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:08:14,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:08:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2121784016, now seen corresponding path program 15 times [2024-02-19 15:08:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:08:14,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126827150] [2024-02-19 15:08:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:08:14,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:08:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:08:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:08:14,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:08:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126827150] [2024-02-19 15:08:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126827150] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:08:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848386512] [2024-02-19 15:08:14,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:08:14,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:08:14,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:08:14,575 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:08:14,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-02-19 15:08:14,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:08:14,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:08:14,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:08:14,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:08:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:08:14,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:08:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:08:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848386512] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:08:14,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:08:14,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-02-19 15:08:14,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490183802] [2024-02-19 15:08:14,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:08:14,890 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:08:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:08:14,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:08:14,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:08:14,927 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-02-19 15:08:14,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 9272 transitions, 348499 flow. Second operand has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:08:14,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:08:14,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-02-19 15:08:14,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:10:07,844 INFO L124 PetriNetUnfolderBase]: 32158/45661 cut-off events. [2024-02-19 15:10:07,844 INFO L125 PetriNetUnfolderBase]: For 416809/416809 co-relation queries the response was YES. [2024-02-19 15:10:07,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849619 conditions, 45661 events. 32158/45661 cut-off events. For 416809/416809 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 274997 event pairs, 105 based on Foata normal form. 22/45681 useless extension candidates. Maximal degree in co-relation 787960. Up to 37979 conditions per place. [2024-02-19 15:10:08,797 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 5982 selfloop transitions, 1807 changer transitions 993/9251 dead transitions. [2024-02-19 15:10:08,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 9251 transitions, 365194 flow [2024-02-19 15:10:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-19 15:10:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-19 15:10:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 318 transitions. [2024-02-19 15:10:08,799 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4781954887218045 [2024-02-19 15:10:08,799 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 501 predicate places. [2024-02-19 15:10:08,799 INFO L507 AbstractCegarLoop]: Abstraction has has 538 places, 9251 transitions, 365194 flow [2024-02-19 15:10:08,800 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:10:08,800 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:10:08,800 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:10:08,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-02-19 15:10:09,011 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:10:09,011 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:10:09,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:10:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1730678668, now seen corresponding path program 16 times [2024-02-19 15:10:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:10:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121047533] [2024-02-19 15:10:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:10:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:10:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:10:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:10:09,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:10:09,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121047533] [2024-02-19 15:10:09,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121047533] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:10:09,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031618950] [2024-02-19 15:10:09,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:10:09,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:10:09,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:10:09,102 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:10:09,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-02-19 15:10:09,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:10:09,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:10:09,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:10:09,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:10:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:10:09,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:10:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:10:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031618950] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:10:09,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:10:09,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-02-19 15:10:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98634064] [2024-02-19 15:10:09,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:10:09,373 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:10:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:10:09,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:10:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:10:09,404 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:10:09,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 9251 transitions, 365194 flow. Second operand has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:10:09,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:10:09,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:10:09,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:12:07,164 INFO L124 PetriNetUnfolderBase]: 33907/48201 cut-off events. [2024-02-19 15:12:07,165 INFO L125 PetriNetUnfolderBase]: For 435959/435959 co-relation queries the response was YES. [2024-02-19 15:12:07,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945318 conditions, 48201 events. 33907/48201 cut-off events. For 435959/435959 co-relation queries the response was YES. Maximal size of possible extension queue 1166. Compared 293335 event pairs, 99 based on Foata normal form. 20/48219 useless extension candidates. Maximal degree in co-relation 866583. Up to 39740 conditions per place. [2024-02-19 15:12:08,120 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 6462 selfloop transitions, 2322 changer transitions 1310/10095 dead transitions. [2024-02-19 15:12:08,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 10095 transitions, 415329 flow [2024-02-19 15:12:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-02-19 15:12:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2024-02-19 15:12:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 740 transitions. [2024-02-19 15:12:08,122 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4065934065934066 [2024-02-19 15:12:08,123 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 552 predicate places. [2024-02-19 15:12:08,123 INFO L507 AbstractCegarLoop]: Abstraction has has 589 places, 10095 transitions, 415329 flow [2024-02-19 15:12:08,123 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:12:08,123 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:12:08,123 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:12:08,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-02-19 15:12:08,331 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:12:08,332 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:12:08,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:12:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1683390466, now seen corresponding path program 2 times [2024-02-19 15:12:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:12:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576506576] [2024-02-19 15:12:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:12:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:12:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:12:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:12:09,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576506576] [2024-02-19 15:12:09,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576506576] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:12:09,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58695840] [2024-02-19 15:12:09,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:12:09,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:12:09,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:12:09,262 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:12:09,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-02-19 15:12:09,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:12:09,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:12:09,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 36 conjunts are in the unsatisfiable core [2024-02-19 15:12:09,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:12:09,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:12:10,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:12:10,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2024-02-19 15:12:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:10,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:12:12,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 230 [2024-02-19 15:12:12,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:12:12,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 283 [2024-02-19 15:12:12,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2024-02-19 15:12:12,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:12:12,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2024-02-19 15:12:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:12:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58695840] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:12:12,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:12:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 43 [2024-02-19 15:12:12,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332000737] [2024-02-19 15:12:12,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:12:12,750 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-02-19 15:12:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:12:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-02-19 15:12:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1658, Unknown=0, NotChecked=0, Total=1892 [2024-02-19 15:12:13,040 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-02-19 15:12:13,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 10095 transitions, 415329 flow. Second operand has 44 states, 44 states have (on average 8.022727272727273) internal successors, (353), 44 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:12:13,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:12:13,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-02-19 15:12:13,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:14:48,481 INFO L124 PetriNetUnfolderBase]: 41596/59163 cut-off events. [2024-02-19 15:14:48,481 INFO L125 PetriNetUnfolderBase]: For 634015/634015 co-relation queries the response was YES. [2024-02-19 15:14:48,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212407 conditions, 59163 events. 41596/59163 cut-off events. For 634015/634015 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 372110 event pairs, 77 based on Foata normal form. 2/59162 useless extension candidates. Maximal degree in co-relation 1082642. Up to 49034 conditions per place. [2024-02-19 15:14:49,656 INFO L140 encePairwiseOnDemand]: 19/35 looper letters, 9045 selfloop transitions, 3156 changer transitions 1334/14427 dead transitions. [2024-02-19 15:14:49,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 14427 transitions, 627381 flow [2024-02-19 15:14:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-02-19 15:14:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2024-02-19 15:14:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 1054 transitions. [2024-02-19 15:14:49,676 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41252446183953034 [2024-02-19 15:14:49,676 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 624 predicate places. [2024-02-19 15:14:49,676 INFO L507 AbstractCegarLoop]: Abstraction has has 661 places, 14427 transitions, 627381 flow [2024-02-19 15:14:49,677 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 8.022727272727273) internal successors, (353), 44 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:14:49,677 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:14:49,677 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:14:49,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-02-19 15:14:49,877 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:14:49,877 INFO L432 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:14:49,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:14:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1540609365, now seen corresponding path program 17 times [2024-02-19 15:14:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:14:49,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692014597] [2024-02-19 15:14:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:14:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:14:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:14:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:14:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:14:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692014597] [2024-02-19 15:14:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692014597] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:14:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208961942] [2024-02-19 15:14:51,094 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:14:51,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:14:51,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:14:51,095 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:14:51,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-02-19 15:14:51,227 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:14:51,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:14:51,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2024-02-19 15:14:51,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:14:52,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:52,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:14:52,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 109 [2024-02-19 15:14:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:14:52,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:14:53,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:14:53,776 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 391 treesize of output 161 [2024-02-19 15:14:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:14:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208961942] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:14:54,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:14:54,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 12] total 41 [2024-02-19 15:14:54,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602571131] [2024-02-19 15:14:54,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:14:54,489 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-02-19 15:14:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:14:54,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-02-19 15:14:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1568, Unknown=0, NotChecked=0, Total=1722 [2024-02-19 15:14:54,840 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:14:54,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 14427 transitions, 627381 flow. Second operand has 42 states, 42 states have (on average 6.261904761904762) internal successors, (263), 42 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:14:54,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:14:54,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:14:54,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15