./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98c397d7a260fe673f9e4655b5dca942c114f9b11115010a8eef60e068615ab1 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:54:05,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:54:05,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:54:05,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:54:05,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:54:05,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:54:05,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:54:05,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:54:05,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:54:05,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:54:05,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:54:05,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:54:05,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:54:05,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:54:05,866 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:54:05,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:54:05,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:54:05,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:54:05,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:54:05,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:54:05,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:54:05,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:54:05,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:54:05,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:54:05,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:54:05,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:54:05,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:54:05,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:54:05,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:54:05,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:54:05,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:54:05,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:54:05,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:54:05,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:54:05,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:54:05,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:54:05,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:54:05,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:54:05,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:54:05,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:54:05,873 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:54:05,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:54:05,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:54:05,874 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 -> 98c397d7a260fe673f9e4655b5dca942c114f9b11115010a8eef60e068615ab1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:54:06,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:54:06,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:54:06,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:54:06,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:54:06,111 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:54:06,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2024-02-20 11:54:07,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:54:07,529 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:54:07,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2024-02-20 11:54:07,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63fde58f/7a90569d03ff4a46bd0d07f2f38d0642/FLAG41c5804ab [2024-02-20 11:54:07,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63fde58f/7a90569d03ff4a46bd0d07f2f38d0642 [2024-02-20 11:54:07,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:54:07,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:54:07,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:54:07,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:54:07,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:54:07,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6e57cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07, skipping insertion in model container [2024-02-20 11:54:07,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,591 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:54:07,787 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c[3345,3358] [2024-02-20 11:54:07,796 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:54:07,804 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:54:07,830 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c[3345,3358] [2024-02-20 11:54:07,834 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:54:07,853 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:54:07,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07 WrapperNode [2024-02-20 11:54:07,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:54:07,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:54:07,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:54:07,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:54:07,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,900 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 187 [2024-02-20 11:54:07,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:54:07,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:54:07,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:54:07,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:54:07,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,937 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 2, 2, 2, 15]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 1, 3]. [2024-02-20 11:54:07,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:54:07,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:54:07,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:54:07,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:54:07,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (1/1) ... [2024-02-20 11:54:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:54:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:54:08,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-20 11:54:08,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-20 11:54:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:54:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:54:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:54:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:54:08,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:54:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 11:54:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 11:54:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:54:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:54:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:54:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 11:54:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 11:54:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:54:08,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:54:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:54:08,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:54:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 11:54:08,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 11:54:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:54:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:54:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:54:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 11:54:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 11:54:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 11:54:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:54:08,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:54:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:54:08,065 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:54:08,163 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:54:08,165 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:54:08,514 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:54:08,514 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:54:08,931 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:54:08,931 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-02-20 11:54:08,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:08 BoogieIcfgContainer [2024-02-20 11:54:08,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:54:08,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:54:08,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:54:08,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:54:08,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:54:07" (1/3) ... [2024-02-20 11:54:08,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7534dafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:08, skipping insertion in model container [2024-02-20 11:54:08,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:07" (2/3) ... [2024-02-20 11:54:08,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7534dafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:08, skipping insertion in model container [2024-02-20 11:54:08,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:08" (3/3) ... [2024-02-20 11:54:08,944 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2024-02-20 11:54:08,961 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:54:08,962 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:54:08,962 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:54:09,017 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 11:54:09,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 123 flow [2024-02-20 11:54:09,108 INFO L124 PetriNetUnfolderBase]: 12/48 cut-off events. [2024-02-20 11:54:09,108 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 11:54:09,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 12/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-02-20 11:54:09,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 51 transitions, 123 flow [2024-02-20 11:54:09,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2024-02-20 11:54:09,133 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:54:09,140 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;@5b042582, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:54:09,141 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 11:54:09,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:54:09,160 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2024-02-20 11:54:09,161 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 11:54:09,161 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:09,162 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] [2024-02-20 11:54:09,162 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:09,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1310669954, now seen corresponding path program 1 times [2024-02-20 11:54:09,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:09,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269698197] [2024-02-20 11:54:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:09,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:09,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269698197] [2024-02-20 11:54:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269698197] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:09,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:54:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245717390] [2024-02-20 11:54:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:09,793 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:54:09,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:54:09,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:54:09,830 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:09,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:09,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:09,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:09,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:10,431 INFO L124 PetriNetUnfolderBase]: 2828/3793 cut-off events. [2024-02-20 11:54:10,431 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2024-02-20 11:54:10,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7789 conditions, 3793 events. 2828/3793 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 16561 event pairs, 1125 based on Foata normal form. 1/2669 useless extension candidates. Maximal degree in co-relation 6505. Up to 2453 conditions per place. [2024-02-20 11:54:10,461 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 62 selfloop transitions, 2 changer transitions 7/75 dead transitions. [2024-02-20 11:54:10,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 325 flow [2024-02-20 11:54:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:54:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:54:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-20 11:54:10,476 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-02-20 11:54:10,480 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-02-20 11:54:10,481 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 75 transitions, 325 flow [2024-02-20 11:54:10,481 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:10,481 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:10,482 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-20 11:54:10,482 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:54:10,482 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:10,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash -363431830, now seen corresponding path program 1 times [2024-02-20 11:54:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462078124] [2024-02-20 11:54:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:11,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462078124] [2024-02-20 11:54:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462078124] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:11,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:11,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:54:11,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865178705] [2024-02-20 11:54:11,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:11,236 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:54:11,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:11,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:54:11,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:54:11,237 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:11,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 75 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:11,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:11,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:11,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:11,917 INFO L124 PetriNetUnfolderBase]: 3378/4601 cut-off events. [2024-02-20 11:54:11,917 INFO L125 PetriNetUnfolderBase]: For 226/230 co-relation queries the response was YES. [2024-02-20 11:54:11,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14059 conditions, 4601 events. 3378/4601 cut-off events. For 226/230 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 21494 event pairs, 95 based on Foata normal form. 1/3319 useless extension candidates. Maximal degree in co-relation 13581. Up to 3160 conditions per place. [2024-02-20 11:54:11,942 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 117 selfloop transitions, 3 changer transitions 48/172 dead transitions. [2024-02-20 11:54:11,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 172 transitions, 1085 flow [2024-02-20 11:54:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-20 11:54:11,945 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5647058823529412 [2024-02-20 11:54:11,946 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-02-20 11:54:11,946 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 172 transitions, 1085 flow [2024-02-20 11:54:11,946 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:11,947 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:11,947 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-20 11:54:11,947 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:54:11,947 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:11,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 902219366, now seen corresponding path program 2 times [2024-02-20 11:54:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281030032] [2024-02-20 11:54:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281030032] [2024-02-20 11:54:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281030032] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:54:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676858870] [2024-02-20 11:54:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:12,421 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:54:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:54:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:54:12,422 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:12,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 172 transitions, 1085 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:12,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:12,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:12,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:13,109 INFO L124 PetriNetUnfolderBase]: 4310/6021 cut-off events. [2024-02-20 11:54:13,112 INFO L125 PetriNetUnfolderBase]: For 360/364 co-relation queries the response was YES. [2024-02-20 11:54:13,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24426 conditions, 6021 events. 4310/6021 cut-off events. For 360/364 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 30701 event pairs, 95 based on Foata normal form. 1/4472 useless extension candidates. Maximal degree in co-relation 23456. Up to 4109 conditions per place. [2024-02-20 11:54:13,198 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 183 selfloop transitions, 5 changer transitions 100/292 dead transitions. [2024-02-20 11:54:13,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 292 transitions, 2438 flow [2024-02-20 11:54:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-02-20 11:54:13,204 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-20 11:54:13,205 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-02-20 11:54:13,205 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 292 transitions, 2438 flow [2024-02-20 11:54:13,205 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:13,205 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:13,206 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-20 11:54:13,206 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:54:13,206 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:13,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:13,207 INFO L85 PathProgramCache]: Analyzing trace with hash 626542932, now seen corresponding path program 3 times [2024-02-20 11:54:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:13,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562307422] [2024-02-20 11:54:13,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:13,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:13,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:13,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562307422] [2024-02-20 11:54:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562307422] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:13,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:13,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:54:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845304602] [2024-02-20 11:54:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:13,731 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:54:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:13,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:54:13,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:54:13,736 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:13,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 292 transitions, 2438 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:13,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:13,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:13,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:14,752 INFO L124 PetriNetUnfolderBase]: 5652/8038 cut-off events. [2024-02-20 11:54:14,753 INFO L125 PetriNetUnfolderBase]: For 528/534 co-relation queries the response was YES. [2024-02-20 11:54:14,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40582 conditions, 8038 events. 5652/8038 cut-off events. For 528/534 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 43336 event pairs, 95 based on Foata normal form. 1/6097 useless extension candidates. Maximal degree in co-relation 39098. Up to 5604 conditions per place. [2024-02-20 11:54:14,806 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 298 selfloop transitions, 7 changer transitions 147/456 dead transitions. [2024-02-20 11:54:14,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 456 transitions, 4717 flow [2024-02-20 11:54:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-02-20 11:54:14,809 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5450980392156862 [2024-02-20 11:54:14,811 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-02-20 11:54:14,812 INFO L507 AbstractCegarLoop]: Abstraction has has 59 places, 456 transitions, 4717 flow [2024-02-20 11:54:14,812 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:14,813 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:14,813 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-20 11:54:14,813 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:54:14,813 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:14,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash 406813290, now seen corresponding path program 4 times [2024-02-20 11:54:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:14,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086020515] [2024-02-20 11:54:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:15,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086020515] [2024-02-20 11:54:15,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086020515] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:15,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:54:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756530706] [2024-02-20 11:54:15,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:15,248 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:54:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:15,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:54:15,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:54:15,250 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:15,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 456 transitions, 4717 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:15,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:15,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:15,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:16,328 INFO L124 PetriNetUnfolderBase]: 5652/8036 cut-off events. [2024-02-20 11:54:16,328 INFO L125 PetriNetUnfolderBase]: For 548/556 co-relation queries the response was YES. [2024-02-20 11:54:16,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48602 conditions, 8036 events. 5652/8036 cut-off events. For 548/556 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 43383 event pairs, 95 based on Foata normal form. 1/6095 useless extension candidates. Maximal degree in co-relation 46848. Up to 5603 conditions per place. [2024-02-20 11:54:16,390 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 276 selfloop transitions, 8 changer transitions 167/455 dead transitions. [2024-02-20 11:54:16,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 455 transitions, 5609 flow [2024-02-20 11:54:16,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-20 11:54:16,392 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5568627450980392 [2024-02-20 11:54:16,394 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-02-20 11:54:16,394 INFO L507 AbstractCegarLoop]: Abstraction has has 63 places, 455 transitions, 5609 flow [2024-02-20 11:54:16,395 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:16,395 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:16,395 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-20 11:54:16,395 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:54:16,395 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:16,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2126775734, now seen corresponding path program 5 times [2024-02-20 11:54:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:16,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597397014] [2024-02-20 11:54:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:17,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597397014] [2024-02-20 11:54:17,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597397014] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:17,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:17,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:54:17,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736703229] [2024-02-20 11:54:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:17,217 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:54:17,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:54:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:54:17,218 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:17,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 455 transitions, 5609 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:17,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:17,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:17,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:18,297 INFO L124 PetriNetUnfolderBase]: 5652/8034 cut-off events. [2024-02-20 11:54:18,298 INFO L125 PetriNetUnfolderBase]: For 588/608 co-relation queries the response was YES. [2024-02-20 11:54:18,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56620 conditions, 8034 events. 5652/8034 cut-off events. For 588/608 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 43218 event pairs, 95 based on Foata normal form. 1/6092 useless extension candidates. Maximal degree in co-relation 54598. Up to 5602 conditions per place. [2024-02-20 11:54:18,364 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 257 selfloop transitions, 6 changer transitions 187/454 dead transitions. [2024-02-20 11:54:18,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 454 transitions, 6497 flow [2024-02-20 11:54:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-02-20 11:54:18,366 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5607843137254902 [2024-02-20 11:54:18,366 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-02-20 11:54:18,367 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 454 transitions, 6497 flow [2024-02-20 11:54:18,367 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:18,367 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:18,367 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-20 11:54:18,367 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:54:18,368 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:18,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash -508064354, now seen corresponding path program 6 times [2024-02-20 11:54:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:18,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648944419] [2024-02-20 11:54:18,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:18,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:18,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648944419] [2024-02-20 11:54:18,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648944419] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:54:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084685734] [2024-02-20 11:54:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:18,995 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:54:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:54:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:54:18,997 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:18,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 454 transitions, 6497 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:18,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:18,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:18,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:20,118 INFO L124 PetriNetUnfolderBase]: 5655/8038 cut-off events. [2024-02-20 11:54:20,118 INFO L125 PetriNetUnfolderBase]: For 603/615 co-relation queries the response was YES. [2024-02-20 11:54:20,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64684 conditions, 8038 events. 5655/8038 cut-off events. For 603/615 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 43377 event pairs, 95 based on Foata normal form. 1/6094 useless extension candidates. Maximal degree in co-relation 62348. Up to 5607 conditions per place. [2024-02-20 11:54:20,183 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 235 selfloop transitions, 10 changer transitions 210/459 dead transitions. [2024-02-20 11:54:20,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 459 transitions, 7477 flow [2024-02-20 11:54:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 11:54:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 11:54:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-02-20 11:54:20,185 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.477124183006536 [2024-02-20 11:54:20,186 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2024-02-20 11:54:20,186 INFO L507 AbstractCegarLoop]: Abstraction has has 72 places, 459 transitions, 7477 flow [2024-02-20 11:54:20,186 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:20,186 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:20,186 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] [2024-02-20 11:54:20,187 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:54:20,187 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:20,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1220204023, now seen corresponding path program 1 times [2024-02-20 11:54:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:20,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163562560] [2024-02-20 11:54:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163562560] [2024-02-20 11:54:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163562560] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802576871] [2024-02-20 11:54:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:20,268 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:20,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:20,269 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:20,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 459 transitions, 7477 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:20,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:20,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:20,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:21,497 INFO L124 PetriNetUnfolderBase]: 6313/8974 cut-off events. [2024-02-20 11:54:21,497 INFO L125 PetriNetUnfolderBase]: For 862/862 co-relation queries the response was YES. [2024-02-20 11:54:21,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81217 conditions, 8974 events. 6313/8974 cut-off events. For 862/862 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 47417 event pairs, 0 based on Foata normal form. 0/6842 useless extension candidates. Maximal degree in co-relation 78488. Up to 6410 conditions per place. [2024-02-20 11:54:21,596 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 385 selfloop transitions, 21 changer transitions 248/658 dead transitions. [2024-02-20 11:54:21,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 658 transitions, 12041 flow [2024-02-20 11:54:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:54:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:54:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-02-20 11:54:21,598 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-20 11:54:21,599 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-02-20 11:54:21,599 INFO L507 AbstractCegarLoop]: Abstraction has has 75 places, 658 transitions, 12041 flow [2024-02-20 11:54:21,599 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:21,599 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:21,600 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] [2024-02-20 11:54:21,600 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:54:21,600 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:21,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:21,601 INFO L85 PathProgramCache]: Analyzing trace with hash -629961109, now seen corresponding path program 1 times [2024-02-20 11:54:21,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:21,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425444590] [2024-02-20 11:54:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:21,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:21,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:21,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425444590] [2024-02-20 11:54:21,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425444590] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:21,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:21,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:21,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31238536] [2024-02-20 11:54:21,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:21,686 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:21,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:21,688 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:21,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 658 transitions, 12041 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:21,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:21,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:21,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:22,895 INFO L124 PetriNetUnfolderBase]: 6757/9631 cut-off events. [2024-02-20 11:54:22,896 INFO L125 PetriNetUnfolderBase]: For 959/975 co-relation queries the response was YES. [2024-02-20 11:54:22,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96810 conditions, 9631 events. 6757/9631 cut-off events. For 959/975 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 51366 event pairs, 0 based on Foata normal form. 0/7384 useless extension candidates. Maximal degree in co-relation 93532. Up to 6660 conditions per place. [2024-02-20 11:54:23,007 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 375 selfloop transitions, 16 changer transitions 314/709 dead transitions. [2024-02-20 11:54:23,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 709 transitions, 14390 flow [2024-02-20 11:54:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-02-20 11:54:23,013 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5803921568627451 [2024-02-20 11:54:23,014 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2024-02-20 11:54:23,015 INFO L507 AbstractCegarLoop]: Abstraction has has 79 places, 709 transitions, 14390 flow [2024-02-20 11:54:23,015 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:23,015 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:23,015 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] [2024-02-20 11:54:23,015 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:54:23,016 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:23,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash -423332763, now seen corresponding path program 2 times [2024-02-20 11:54:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:23,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285464521] [2024-02-20 11:54:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:23,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285464521] [2024-02-20 11:54:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285464521] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:23,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898324203] [2024-02-20 11:54:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:23,121 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:23,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:23,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:23,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:23,123 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:23,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 709 transitions, 14390 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:23,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:23,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:23,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:24,421 INFO L124 PetriNetUnfolderBase]: 6685/9559 cut-off events. [2024-02-20 11:54:24,422 INFO L125 PetriNetUnfolderBase]: For 1036/1072 co-relation queries the response was YES. [2024-02-20 11:54:24,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105641 conditions, 9559 events. 6685/9559 cut-off events. For 1036/1072 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 51158 event pairs, 0 based on Foata normal form. 0/7383 useless extension candidates. Maximal degree in co-relation 102068. Up to 6588 conditions per place. [2024-02-20 11:54:24,511 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 394 selfloop transitions, 20 changer transitions 314/732 dead transitions. [2024-02-20 11:54:24,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 732 transitions, 16312 flow [2024-02-20 11:54:24,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:54:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:54:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-02-20 11:54:24,517 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5931372549019608 [2024-02-20 11:54:24,518 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2024-02-20 11:54:24,518 INFO L507 AbstractCegarLoop]: Abstraction has has 82 places, 732 transitions, 16312 flow [2024-02-20 11:54:24,519 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:24,519 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:24,519 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] [2024-02-20 11:54:24,519 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 11:54:24,519 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:24,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1778861405, now seen corresponding path program 2 times [2024-02-20 11:54:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490643857] [2024-02-20 11:54:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490643857] [2024-02-20 11:54:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490643857] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:24,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:24,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:24,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526003523] [2024-02-20 11:54:24,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:24,595 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:24,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:24,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:24,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:24,596 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:24,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 732 transitions, 16312 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:24,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:24,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:24,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:26,145 INFO L124 PetriNetUnfolderBase]: 7209/10306 cut-off events. [2024-02-20 11:54:26,146 INFO L125 PetriNetUnfolderBase]: For 1107/1147 co-relation queries the response was YES. [2024-02-20 11:54:26,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124166 conditions, 10306 events. 7209/10306 cut-off events. For 1107/1147 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 55689 event pairs, 0 based on Foata normal form. 0/7982 useless extension candidates. Maximal degree in co-relation 119983. Up to 7110 conditions per place. [2024-02-20 11:54:26,256 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 448 selfloop transitions, 20 changer transitions 314/786 dead transitions. [2024-02-20 11:54:26,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 786 transitions, 19076 flow [2024-02-20 11:54:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:54:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:54:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-02-20 11:54:26,258 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5931372549019608 [2024-02-20 11:54:26,258 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-02-20 11:54:26,259 INFO L507 AbstractCegarLoop]: Abstraction has has 85 places, 786 transitions, 19076 flow [2024-02-20 11:54:26,259 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:26,259 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:26,259 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] [2024-02-20 11:54:26,259 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-20 11:54:26,260 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:26,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1135208185, now seen corresponding path program 3 times [2024-02-20 11:54:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:26,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497462709] [2024-02-20 11:54:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497462709] [2024-02-20 11:54:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497462709] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:26,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:26,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362989536] [2024-02-20 11:54:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:26,350 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:26,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:26,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:26,351 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:26,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 786 transitions, 19076 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:26,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:26,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:26,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:28,151 INFO L124 PetriNetUnfolderBase]: 6927/9907 cut-off events. [2024-02-20 11:54:28,151 INFO L125 PetriNetUnfolderBase]: For 1068/1090 co-relation queries the response was YES. [2024-02-20 11:54:28,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129280 conditions, 9907 events. 6927/9907 cut-off events. For 1068/1090 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 53145 event pairs, 0 based on Foata normal form. 0/7696 useless extension candidates. Maximal degree in co-relation 124866. Up to 7206 conditions per place. [2024-02-20 11:54:28,254 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 410 selfloop transitions, 12 changer transitions 340/766 dead transitions. [2024-02-20 11:54:28,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 766 transitions, 20114 flow [2024-02-20 11:54:28,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-02-20 11:54:28,256 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-20 11:54:28,256 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-02-20 11:54:28,256 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 766 transitions, 20114 flow [2024-02-20 11:54:28,257 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:28,257 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:28,257 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] [2024-02-20 11:54:28,257 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-20 11:54:28,257 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:28,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash -786655797, now seen corresponding path program 3 times [2024-02-20 11:54:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:28,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617511847] [2024-02-20 11:54:28,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617511847] [2024-02-20 11:54:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617511847] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:28,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570103103] [2024-02-20 11:54:28,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:28,326 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:28,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:28,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:28,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:28,327 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:28,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 766 transitions, 20114 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:28,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:28,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:28,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:29,958 INFO L124 PetriNetUnfolderBase]: 6219/8899 cut-off events. [2024-02-20 11:54:29,958 INFO L125 PetriNetUnfolderBase]: For 1115/1163 co-relation queries the response was YES. [2024-02-20 11:54:29,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125064 conditions, 8899 events. 6219/8899 cut-off events. For 1115/1163 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 47145 event pairs, 0 based on Foata normal form. 0/6941 useless extension candidates. Maximal degree in co-relation 120806. Up to 6694 conditions per place. [2024-02-20 11:54:30,026 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 318 selfloop transitions, 8 changer transitions 374/704 dead transitions. [2024-02-20 11:54:30,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 704 transitions, 19884 flow [2024-02-20 11:54:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-02-20 11:54:30,028 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2024-02-20 11:54:30,028 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2024-02-20 11:54:30,029 INFO L507 AbstractCegarLoop]: Abstraction has has 93 places, 704 transitions, 19884 flow [2024-02-20 11:54:30,029 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:30,029 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:30,029 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] [2024-02-20 11:54:30,029 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-20 11:54:30,029 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:30,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash 819833735, now seen corresponding path program 4 times [2024-02-20 11:54:30,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:30,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127163621] [2024-02-20 11:54:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:30,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:30,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127163621] [2024-02-20 11:54:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127163621] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252512121] [2024-02-20 11:54:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:30,114 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:30,115 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:30,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 704 transitions, 19884 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:30,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:30,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:30,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:31,673 INFO L124 PetriNetUnfolderBase]: 6233/8933 cut-off events. [2024-02-20 11:54:31,673 INFO L125 PetriNetUnfolderBase]: For 1180/1232 co-relation queries the response was YES. [2024-02-20 11:54:31,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134467 conditions, 8933 events. 6233/8933 cut-off events. For 1180/1232 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 47361 event pairs, 0 based on Foata normal form. 0/6997 useless extension candidates. Maximal degree in co-relation 129912. Up to 6728 conditions per place. [2024-02-20 11:54:31,754 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 317 selfloop transitions, 3 changer transitions 388/712 dead transitions. [2024-02-20 11:54:31,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 712 transitions, 21524 flow [2024-02-20 11:54:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-02-20 11:54:31,756 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6196078431372549 [2024-02-20 11:54:31,756 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 52 predicate places. [2024-02-20 11:54:31,756 INFO L507 AbstractCegarLoop]: Abstraction has has 97 places, 712 transitions, 21524 flow [2024-02-20 11:54:31,757 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:31,757 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:31,757 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] [2024-02-20 11:54:31,757 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-20 11:54:31,757 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:31,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash 863883661, now seen corresponding path program 4 times [2024-02-20 11:54:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:31,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153048007] [2024-02-20 11:54:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:31,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153048007] [2024-02-20 11:54:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153048007] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:31,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815139984] [2024-02-20 11:54:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:31,848 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:31,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:31,849 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:31,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 712 transitions, 21524 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:31,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:31,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:31,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:33,229 INFO L124 PetriNetUnfolderBase]: 5927/8494 cut-off events. [2024-02-20 11:54:33,229 INFO L125 PetriNetUnfolderBase]: For 1129/1157 co-relation queries the response was YES. [2024-02-20 11:54:33,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136369 conditions, 8494 events. 5927/8494 cut-off events. For 1129/1157 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 44838 event pairs, 0 based on Foata normal form. 0/6671 useless extension candidates. Maximal degree in co-relation 131908. Up to 6226 conditions per place. [2024-02-20 11:54:33,313 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 271 selfloop transitions, 9 changer transitions 407/691 dead transitions. [2024-02-20 11:54:33,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 691 transitions, 22259 flow [2024-02-20 11:54:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-02-20 11:54:33,315 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5843137254901961 [2024-02-20 11:54:33,316 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 56 predicate places. [2024-02-20 11:54:33,316 INFO L507 AbstractCegarLoop]: Abstraction has has 101 places, 691 transitions, 22259 flow [2024-02-20 11:54:33,316 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:33,316 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:33,317 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] [2024-02-20 11:54:33,317 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-20 11:54:33,317 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-20 11:54:33,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1197502107, now seen corresponding path program 5 times [2024-02-20 11:54:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863652661] [2024-02-20 11:54:33,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:33,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:33,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863652661] [2024-02-20 11:54:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863652661] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:33,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:33,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691721333] [2024-02-20 11:54:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:33,390 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:33,390 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:33,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 691 transitions, 22259 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:33,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:33,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:33,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:34,827 INFO L124 PetriNetUnfolderBase]: 5527/7941 cut-off events. [2024-02-20 11:54:34,827 INFO L125 PetriNetUnfolderBase]: For 1153/1183 co-relation queries the response was YES. [2024-02-20 11:54:34,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135457 conditions, 7941 events. 5527/7941 cut-off events. For 1153/1183 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 41462 event pairs, 0 based on Foata normal form. 0/6288 useless extension candidates. Maximal degree in co-relation 131138. Up to 5964 conditions per place. [2024-02-20 11:54:35,208 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 261 selfloop transitions, 11 changer transitions 407/683 dead transitions. [2024-02-20 11:54:35,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 683 transitions, 23355 flow [2024-02-20 11:54:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:54:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:54:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-02-20 11:54:35,210 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2024-02-20 11:54:35,210 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2024-02-20 11:54:35,210 INFO L507 AbstractCegarLoop]: Abstraction has has 104 places, 683 transitions, 23355 flow [2024-02-20 11:54:35,211 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:35,211 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:35,211 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] [2024-02-20 11:54:35,211 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-20 11:54:35,211 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-20 11:54:35,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash 963964789, now seen corresponding path program 5 times [2024-02-20 11:54:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:35,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541205156] [2024-02-20 11:54:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541205156] [2024-02-20 11:54:35,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541205156] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:35,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:35,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:54:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812148631] [2024-02-20 11:54:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:35,285 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:54:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:54:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:54:35,287 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:35,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 683 transitions, 23355 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:35,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:35,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:35,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:36,928 INFO L124 PetriNetUnfolderBase]: 4783/6889 cut-off events. [2024-02-20 11:54:36,929 INFO L125 PetriNetUnfolderBase]: For 1249/1313 co-relation queries the response was YES. [2024-02-20 11:54:36,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124431 conditions, 6889 events. 4783/6889 cut-off events. For 1249/1313 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 35497 event pairs, 0 based on Foata normal form. 0/5507 useless extension candidates. Maximal degree in co-relation 120467. Up to 5109 conditions per place. [2024-02-20 11:54:36,987 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 230 selfloop transitions, 0 changer transitions 399/633 dead transitions. [2024-02-20 11:54:36,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 633 transitions, 22895 flow [2024-02-20 11:54:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-02-20 11:54:36,989 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-20 11:54:36,989 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 63 predicate places. [2024-02-20 11:54:36,989 INFO L507 AbstractCegarLoop]: Abstraction has has 108 places, 633 transitions, 22895 flow [2024-02-20 11:54:36,990 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:36,990 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:36,990 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:54:36,990 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-20 11:54:36,990 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-20 11:54:36,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash 276536424, now seen corresponding path program 1 times [2024-02-20 11:54:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419961854] [2024-02-20 11:54:36,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419961854] [2024-02-20 11:54:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419961854] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-20 11:54:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520865406] [2024-02-20 11:54:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:37,376 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:54:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:54:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-02-20 11:54:37,377 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-02-20 11:54:37,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 633 transitions, 22895 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:37,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:37,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-02-20 11:54:37,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:54:39,859 INFO L124 PetriNetUnfolderBase]: 8748/12316 cut-off events. [2024-02-20 11:54:39,860 INFO L125 PetriNetUnfolderBase]: For 2042/2076 co-relation queries the response was YES. [2024-02-20 11:54:39,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234744 conditions, 12316 events. 8748/12316 cut-off events. For 2042/2076 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 65982 event pairs, 0 based on Foata normal form. 1/9698 useless extension candidates. Maximal degree in co-relation 143738. Up to 10423 conditions per place. [2024-02-20 11:54:39,987 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 515 selfloop transitions, 55 changer transitions 542/1116 dead transitions. [2024-02-20 11:54:39,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 1116 transitions, 42666 flow [2024-02-20 11:54:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-20 11:54:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-20 11:54:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-02-20 11:54:39,988 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2024-02-20 11:54:39,989 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 69 predicate places. [2024-02-20 11:54:39,989 INFO L507 AbstractCegarLoop]: Abstraction has has 114 places, 1116 transitions, 42666 flow [2024-02-20 11:54:39,989 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:39,989 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:39,990 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:54:39,990 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-20 11:54:39,990 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-20 11:54:39,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1042179009, now seen corresponding path program 1 times [2024-02-20 11:54:39,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:39,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803424307] [2024-02-20 11:54:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:39,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803424307] [2024-02-20 11:54:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803424307] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:54:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906098069] [2024-02-20 11:54:40,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:40,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:54:40,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:54:40,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:54:40,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-20 11:54:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:40,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 36 conjunts are in the unsatisfiable core [2024-02-20 11:54:40,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:54:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:40,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:54:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:54:42,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906098069] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:54:42,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:54:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2024-02-20 11:54:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346940327] [2024-02-20 11:54:42,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:54:42,555 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-02-20 11:54:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:42,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-02-20 11:54:42,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2024-02-20 11:54:42,565 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 51 [2024-02-20 11:54:42,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 1116 transitions, 42666 flow. Second operand has 28 states, 28 states have (on average 8.321428571428571) internal successors, (233), 28 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:54:42,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:42,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 51 [2024-02-20 11:54:42,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:55:05,220 INFO L124 PetriNetUnfolderBase]: 45771/65825 cut-off events. [2024-02-20 11:55:05,220 INFO L125 PetriNetUnfolderBase]: For 194192/195599 co-relation queries the response was YES. [2024-02-20 11:55:05,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259621 conditions, 65825 events. 45771/65825 cut-off events. For 194192/195599 co-relation queries the response was YES. Maximal size of possible extension queue 2704. Compared 453678 event pairs, 550 based on Foata normal form. 65/53963 useless extension candidates. Maximal degree in co-relation 326226. Up to 52572 conditions per place. [2024-02-20 11:55:05,983 INFO L140 encePairwiseOnDemand]: 32/51 looper letters, 2560 selfloop transitions, 461 changer transitions 3497/6520 dead transitions. [2024-02-20 11:55:05,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 6520 transitions, 261699 flow [2024-02-20 11:55:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-02-20 11:55:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2024-02-20 11:55:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 1399 transitions. [2024-02-20 11:55:05,988 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4898459383753501 [2024-02-20 11:55:05,988 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 124 predicate places. [2024-02-20 11:55:05,989 INFO L507 AbstractCegarLoop]: Abstraction has has 169 places, 6520 transitions, 261699 flow [2024-02-20 11:55:05,989 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.321428571428571) internal successors, (233), 28 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:55:05,989 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:55:05,989 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:55:06,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-20 11:55:06,204 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:55:06,204 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-20 11:55:06,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:55:06,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2024760552, now seen corresponding path program 1 times [2024-02-20 11:55:06,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:55:06,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428730345] [2024-02-20 11:55:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:55:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:55:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:55:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:55:06,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:55:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428730345] [2024-02-20 11:55:06,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428730345] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:55:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775523873] [2024-02-20 11:55:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:55:06,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:55:06,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:55:06,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:55:06,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-20 11:55:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:55:06,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjunts are in the unsatisfiable core [2024-02-20 11:55:06,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:55:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:55:07,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:55:08,527 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-20 11:55:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775523873] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 11:55:08,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 11:55:08,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 12] total 25 [2024-02-20 11:55:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004847826] [2024-02-20 11:55:08,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:55:08,528 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:55:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:55:08,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:55:08,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-02-20 11:55:08,535 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2024-02-20 11:55:08,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 6520 transitions, 261699 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:55:08,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:55:08,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2024-02-20 11:55:08,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:58:15,630 INFO L124 PetriNetUnfolderBase]: 93701/134437 cut-off events. [2024-02-20 11:58:15,630 INFO L125 PetriNetUnfolderBase]: For 1020390/1020390 co-relation queries the response was YES. [2024-02-20 11:58:15,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649295 conditions, 134437 events. 93701/134437 cut-off events. For 1020390/1020390 co-relation queries the response was YES. Maximal size of possible extension queue 5038. Compared 1002200 event pairs, 488 based on Foata normal form. 2/110450 useless extension candidates. Maximal degree in co-relation 577240. Up to 107965 conditions per place. [2024-02-20 11:58:17,508 INFO L140 encePairwiseOnDemand]: 36/51 looper letters, 5164 selfloop transitions, 790 changer transitions 6696/12651 dead transitions. [2024-02-20 11:58:17,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 12651 transitions, 532570 flow [2024-02-20 11:58:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-20 11:58:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-20 11:58:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 538 transitions. [2024-02-20 11:58:17,510 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5023342670401494 [2024-02-20 11:58:17,510 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 144 predicate places. [2024-02-20 11:58:17,510 INFO L507 AbstractCegarLoop]: Abstraction has has 189 places, 12651 transitions, 532570 flow [2024-02-20 11:58:17,511 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:58:17,511 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:58:17,511 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:58:17,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-20 11:58:17,728 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-02-20 11:58:17,728 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-20 11:58:17,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:58:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash -633997204, now seen corresponding path program 2 times [2024-02-20 11:58:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:58:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426744064] [2024-02-20 11:58:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:58:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:58:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:58:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:58:17,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:58:17,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426744064] [2024-02-20 11:58:17,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426744064] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:58:17,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745429600] [2024-02-20 11:58:17,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:58:17,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:58:17,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:58:17,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:58:17,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-20 11:58:18,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-20 11:58:18,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:58:18,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 32 conjunts are in the unsatisfiable core [2024-02-20 11:58:18,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:58:18,438 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-20 11:58:18,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:58:18,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745429600] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:58:18,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:58:18,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 16 [2024-02-20 11:58:18,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157133705] [2024-02-20 11:58:18,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:58:18,439 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-20 11:58:18,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:58:18,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-20 11:58:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-02-20 11:58:18,453 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2024-02-20 11:58:18,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 12651 transitions, 532570 flow. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:58:18,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:58:18,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2024-02-20 11:58:18,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand