/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:36:21,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:36:21,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:36:21,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:36:21,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:36:21,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:36:21,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:36:21,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:36:21,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:36:21,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:36:21,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:36:21,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:36:21,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:36:21,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:36:21,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:36:21,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:36:21,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:36:21,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:36:21,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:36:21,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:36:21,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:36:21,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:36:21,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:36:21,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:36:21,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:36:21,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:36:21,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:36:21,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:36:21,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:36:21,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:36:21,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:36:21,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:36:21,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:36:21,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:36:21,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:36:21,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:36:21,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:36:21,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:36:21,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:36:21,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:36:21,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:36:21,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:36:22,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:36:22,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:36:22,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:36:22,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:36:22,007 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:36:22,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:36:22,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:36:22,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:36:22,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:36:22,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:36:22,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:36:22,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:36:22,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:36:22,009 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:36:22,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:36:22,009 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:36:22,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:36:22,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:36:22,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:36:22,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:36:22,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-13 00:36:22,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:36:22,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:36:22,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:36:22,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:36:22,319 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:36:22,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-13 00:36:23,244 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:36:23,510 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:36:23,510 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-13 00:36:23,520 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a95594a/2b550a991be3464eb7844d84e40c8b39/FLAGe69f1168f [2022-12-13 00:36:23,537 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a95594a/2b550a991be3464eb7844d84e40c8b39 [2022-12-13 00:36:23,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:36:23,540 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:36:23,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:36:23,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:36:23,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:36:23,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:23,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a06069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23, skipping insertion in model container [2022-12-13 00:36:23,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:23,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:36:23,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:36:23,725 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2022-12-13 00:36:23,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:36:23,902 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:36:23,911 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2022-12-13 00:36:23,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:36:23,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:36:23,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:36:23,976 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:36:23,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23 WrapperNode [2022-12-13 00:36:23,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:36:23,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:36:23,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:36:23,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:36:23,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:23,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,011 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 00:36:24,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:36:24,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:36:24,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:36:24,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:36:24,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,030 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:36:24,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:36:24,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:36:24,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:36:24,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (1/1) ... [2022-12-13 00:36:24,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:36:24,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:36:24,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:36:24,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:36:24,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:36:24,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:36:24,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:36:24,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:36:24,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:36:24,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:36:24,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:36:24,092 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:36:24,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:36:24,092 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:36:24,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:36:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:36:24,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:36:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:36:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:36:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:36:24,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:36:24,094 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:36:24,186 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:36:24,188 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:36:24,435 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:36:24,568 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:36:24,569 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:36:24,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:24 BoogieIcfgContainer [2022-12-13 00:36:24,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:36:24,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:36:24,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:36:24,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:36:24,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:36:23" (1/3) ... [2022-12-13 00:36:24,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4dabd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:24, skipping insertion in model container [2022-12-13 00:36:24,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:23" (2/3) ... [2022-12-13 00:36:24,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4dabd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:24, skipping insertion in model container [2022-12-13 00:36:24,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:24" (3/3) ... [2022-12-13 00:36:24,578 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2022-12-13 00:36:24,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:36:24,595 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:36:24,595 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:36:24,673 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:36:24,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 00:36:24,820 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 00:36:24,820 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:24,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 00:36:24,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 00:36:24,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-13 00:36:24,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:24,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 00:36:24,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-13 00:36:24,896 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 00:36:24,897 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:24,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 00:36:24,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 00:36:24,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 2852 [2022-12-13 00:36:29,936 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-13 00:36:29,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:36:29,966 INFO L357 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3682958c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:36:29,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:36:29,982 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 00:36:29,982 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:29,982 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:29,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:29,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:36:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:29,987 INFO L85 PathProgramCache]: Analyzing trace with hash -710551530, now seen corresponding path program 1 times [2022-12-13 00:36:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:29,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514339662] [2022-12-13 00:36:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:30,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514339662] [2022-12-13 00:36:30,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514339662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:30,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:30,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:36:30,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069475697] [2022-12-13 00:36:30,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:30,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:36:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:30,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:36:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:36:30,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 71 [2022-12-13 00:36:30,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:30,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:30,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 71 [2022-12-13 00:36:30,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:35,151 INFO L130 PetriNetUnfolder]: 43504/62894 cut-off events. [2022-12-13 00:36:35,152 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-13 00:36:35,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120803 conditions, 62894 events. 43504/62894 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 3603. Compared 474314 event pairs, 11360 based on Foata normal form. 0/38728 useless extension candidates. Maximal degree in co-relation 120791. Up to 48285 conditions per place. [2022-12-13 00:36:35,310 INFO L137 encePairwiseOnDemand]: 66/71 looper letters, 40 selfloop transitions, 2 changer transitions 54/111 dead transitions. [2022-12-13 00:36:35,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 111 transitions, 429 flow [2022-12-13 00:36:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:36:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:36:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-12-13 00:36:35,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6854460093896714 [2022-12-13 00:36:35,321 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 154 flow. Second operand 3 states and 146 transitions. [2022-12-13 00:36:35,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 111 transitions, 429 flow [2022-12-13 00:36:35,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 111 transitions, 424 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:36:35,327 INFO L231 Difference]: Finished difference. Result has 79 places, 41 transitions, 94 flow [2022-12-13 00:36:35,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=79, PETRI_TRANSITIONS=41} [2022-12-13 00:36:35,331 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -4 predicate places. [2022-12-13 00:36:35,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:35,332 INFO L89 Accepts]: Start accepts. Operand has 79 places, 41 transitions, 94 flow [2022-12-13 00:36:35,335 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:35,335 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:35,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 41 transitions, 94 flow [2022-12-13 00:36:35,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2022-12-13 00:36:35,344 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-13 00:36:35,344 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:35,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:36:35,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 94 flow [2022-12-13 00:36:35,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 1000 [2022-12-13 00:36:35,543 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:36:35,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 00:36:35,545 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 94 flow [2022-12-13 00:36:35,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:35,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:35,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:35,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:36:35,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:36:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1665542740, now seen corresponding path program 1 times [2022-12-13 00:36:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:35,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039811941] [2022-12-13 00:36:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:35,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039811941] [2022-12-13 00:36:35,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039811941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:35,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:35,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:36:35,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336862418] [2022-12-13 00:36:35,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:35,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:36:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:35,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:36:35,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:36:35,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2022-12-13 00:36:35,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:35,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:35,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2022-12-13 00:36:35,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:37,285 INFO L130 PetriNetUnfolder]: 16980/23608 cut-off events. [2022-12-13 00:36:37,285 INFO L131 PetriNetUnfolder]: For 913/913 co-relation queries the response was YES. [2022-12-13 00:36:37,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47466 conditions, 23608 events. 16980/23608 cut-off events. For 913/913 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 129944 event pairs, 8259 based on Foata normal form. 0/18657 useless extension candidates. Maximal degree in co-relation 47456. Up to 22336 conditions per place. [2022-12-13 00:36:37,391 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 41 selfloop transitions, 5 changer transitions 2/58 dead transitions. [2022-12-13 00:36:37,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 232 flow [2022-12-13 00:36:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:36:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:36:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-13 00:36:37,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277 [2022-12-13 00:36:37,393 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 94 flow. Second operand 3 states and 79 transitions. [2022-12-13 00:36:37,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 232 flow [2022-12-13 00:36:37,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:36:37,395 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 121 flow [2022-12-13 00:36:37,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-13 00:36:37,396 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2022-12-13 00:36:37,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:37,396 INFO L89 Accepts]: Start accepts. Operand has 53 places, 44 transitions, 121 flow [2022-12-13 00:36:37,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:37,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:37,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 121 flow [2022-12-13 00:36:37,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 121 flow [2022-12-13 00:36:37,410 INFO L130 PetriNetUnfolder]: 45/204 cut-off events. [2022-12-13 00:36:37,411 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:36:37,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 204 events. 45/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1083 event pairs, 23 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 287. Up to 76 conditions per place. [2022-12-13 00:36:37,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 121 flow [2022-12-13 00:36:37,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 1024 [2022-12-13 00:36:37,459 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:36:37,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 00:36:37,461 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 121 flow [2022-12-13 00:36:37,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:37,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:37,462 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:37,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:36:37,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:36:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:37,469 INFO L85 PathProgramCache]: Analyzing trace with hash 851446441, now seen corresponding path program 1 times [2022-12-13 00:36:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:37,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918061737] [2022-12-13 00:36:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:37,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:37,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918061737] [2022-12-13 00:36:37,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918061737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:37,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:37,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:36:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947894347] [2022-12-13 00:36:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:37,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:36:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:37,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:36:37,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:36:37,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:36:37,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:37,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:37,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:36:37,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:38,920 INFO L130 PetriNetUnfolder]: 12559/17572 cut-off events. [2022-12-13 00:36:38,920 INFO L131 PetriNetUnfolder]: For 2799/2799 co-relation queries the response was YES. [2022-12-13 00:36:38,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38491 conditions, 17572 events. 12559/17572 cut-off events. For 2799/2799 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 92255 event pairs, 3481 based on Foata normal form. 284/14854 useless extension candidates. Maximal degree in co-relation 38480. Up to 12401 conditions per place. [2022-12-13 00:36:39,050 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 46 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-13 00:36:39,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 255 flow [2022-12-13 00:36:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:36:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:36:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-13 00:36:39,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 00:36:39,052 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 121 flow. Second operand 3 states and 76 transitions. [2022-12-13 00:36:39,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 255 flow [2022-12-13 00:36:39,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:36:39,053 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 127 flow [2022-12-13 00:36:39,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2022-12-13 00:36:39,054 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -29 predicate places. [2022-12-13 00:36:39,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:39,054 INFO L89 Accepts]: Start accepts. Operand has 54 places, 44 transitions, 127 flow [2022-12-13 00:36:39,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:39,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:39,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 44 transitions, 127 flow [2022-12-13 00:36:39,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 127 flow [2022-12-13 00:36:39,063 INFO L130 PetriNetUnfolder]: 29/131 cut-off events. [2022-12-13 00:36:39,063 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 00:36:39,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 131 events. 29/131 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 614 event pairs, 11 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 211. Up to 53 conditions per place. [2022-12-13 00:36:39,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 44 transitions, 127 flow [2022-12-13 00:36:39,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 00:36:39,068 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:36:39,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 00:36:39,069 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 127 flow [2022-12-13 00:36:39,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:39,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:39,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:39,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:36:39,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:36:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1437862159, now seen corresponding path program 1 times [2022-12-13 00:36:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:39,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860833636] [2022-12-13 00:36:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:39,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860833636] [2022-12-13 00:36:39,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860833636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:39,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:39,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:36:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744253284] [2022-12-13 00:36:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:39,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:36:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:39,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:36:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:36:39,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:36:39,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:39,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:39,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:36:39,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:41,088 INFO L130 PetriNetUnfolder]: 20595/28741 cut-off events. [2022-12-13 00:36:41,088 INFO L131 PetriNetUnfolder]: For 4305/4398 co-relation queries the response was YES. [2022-12-13 00:36:41,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62037 conditions, 28741 events. 20595/28741 cut-off events. For 4305/4398 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 174757 event pairs, 6058 based on Foata normal form. 1648/20084 useless extension candidates. Maximal degree in co-relation 62024. Up to 22708 conditions per place. [2022-12-13 00:36:41,323 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 70 selfloop transitions, 26 changer transitions 0/109 dead transitions. [2022-12-13 00:36:41,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 109 transitions, 463 flow [2022-12-13 00:36:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:36:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:36:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 00:36:41,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.73 [2022-12-13 00:36:41,325 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 127 flow. Second operand 5 states and 146 transitions. [2022-12-13 00:36:41,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 109 transitions, 463 flow [2022-12-13 00:36:41,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:36:41,335 INFO L231 Difference]: Finished difference. Result has 59 places, 69 transitions, 316 flow [2022-12-13 00:36:41,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=59, PETRI_TRANSITIONS=69} [2022-12-13 00:36:41,337 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2022-12-13 00:36:41,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:41,337 INFO L89 Accepts]: Start accepts. Operand has 59 places, 69 transitions, 316 flow [2022-12-13 00:36:41,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:41,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:41,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 69 transitions, 316 flow [2022-12-13 00:36:41,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 69 transitions, 316 flow [2022-12-13 00:36:41,660 INFO L130 PetriNetUnfolder]: 4760/7220 cut-off events. [2022-12-13 00:36:41,660 INFO L131 PetriNetUnfolder]: For 1660/4408 co-relation queries the response was YES. [2022-12-13 00:36:41,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20845 conditions, 7220 events. 4760/7220 cut-off events. For 1660/4408 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 52409 event pairs, 2607 based on Foata normal form. 2/3064 useless extension candidates. Maximal degree in co-relation 20832. Up to 6158 conditions per place. [2022-12-13 00:36:41,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 69 transitions, 316 flow [2022-12-13 00:36:41,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 1528 [2022-12-13 00:36:42,788 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:36:42,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1452 [2022-12-13 00:36:42,789 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 68 transitions, 310 flow [2022-12-13 00:36:42,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:42,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:42,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:42,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:36:42,790 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:36:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 640850477, now seen corresponding path program 1 times [2022-12-13 00:36:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:42,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049433039] [2022-12-13 00:36:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:42,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049433039] [2022-12-13 00:36:42,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049433039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:42,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:42,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:36:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292593766] [2022-12-13 00:36:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:42,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:36:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:36:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:36:42,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:36:42,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 68 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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) [2022-12-13 00:36:42,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:42,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:36:42,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:44,417 INFO L130 PetriNetUnfolder]: 14841/21690 cut-off events. [2022-12-13 00:36:44,417 INFO L131 PetriNetUnfolder]: For 8185/8212 co-relation queries the response was YES. [2022-12-13 00:36:44,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71911 conditions, 21690 events. 14841/21690 cut-off events. For 8185/8212 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 138837 event pairs, 2065 based on Foata normal form. 1521/15687 useless extension candidates. Maximal degree in co-relation 71895. Up to 14365 conditions per place. [2022-12-13 00:36:44,594 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 80 selfloop transitions, 38 changer transitions 0/131 dead transitions. [2022-12-13 00:36:44,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 131 transitions, 788 flow [2022-12-13 00:36:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:36:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:36:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2022-12-13 00:36:44,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7458333333333333 [2022-12-13 00:36:44,596 INFO L175 Difference]: Start difference. First operand has 59 places, 68 transitions, 310 flow. Second operand 6 states and 179 transitions. [2022-12-13 00:36:44,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 131 transitions, 788 flow [2022-12-13 00:36:44,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 773 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:36:44,866 INFO L231 Difference]: Finished difference. Result has 63 places, 81 transitions, 551 flow [2022-12-13 00:36:44,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=551, PETRI_PLACES=63, PETRI_TRANSITIONS=81} [2022-12-13 00:36:44,867 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -20 predicate places. [2022-12-13 00:36:44,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:44,867 INFO L89 Accepts]: Start accepts. Operand has 63 places, 81 transitions, 551 flow [2022-12-13 00:36:44,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:44,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:44,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 81 transitions, 551 flow [2022-12-13 00:36:44,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 81 transitions, 551 flow [2022-12-13 00:36:45,349 INFO L130 PetriNetUnfolder]: 3833/6112 cut-off events. [2022-12-13 00:36:45,350 INFO L131 PetriNetUnfolder]: For 5103/13599 co-relation queries the response was YES. [2022-12-13 00:36:45,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27997 conditions, 6112 events. 3833/6112 cut-off events. For 5103/13599 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 45212 event pairs, 1059 based on Foata normal form. 11/2696 useless extension candidates. Maximal degree in co-relation 27981. Up to 5257 conditions per place. [2022-12-13 00:36:45,403 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 81 transitions, 551 flow [2022-12-13 00:36:45,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 1868 [2022-12-13 00:36:46,472 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:36:46,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1606 [2022-12-13 00:36:46,473 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 80 transitions, 543 flow [2022-12-13 00:36:46,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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) [2022-12-13 00:36:46,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:46,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:36:46,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:36:46,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:36:46,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:46,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1552085109, now seen corresponding path program 1 times [2022-12-13 00:36:46,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:46,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521779497] [2022-12-13 00:36:46,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:46,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:46,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521779497] [2022-12-13 00:36:46,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521779497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:46,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:46,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:36:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137549367] [2022-12-13 00:36:46,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:46,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:36:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:46,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:36:46,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:36:46,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:36:46,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 80 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:46,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:46,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:36:46,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:47,775 INFO L130 PetriNetUnfolder]: 8214/12894 cut-off events. [2022-12-13 00:36:47,776 INFO L131 PetriNetUnfolder]: For 9618/9618 co-relation queries the response was YES. [2022-12-13 00:36:47,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55213 conditions, 12894 events. 8214/12894 cut-off events. For 9618/9618 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 85402 event pairs, 535 based on Foata normal form. 1089/9589 useless extension candidates. Maximal degree in co-relation 55194. Up to 7378 conditions per place. [2022-12-13 00:36:47,851 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 72 selfloop transitions, 50 changer transitions 17/152 dead transitions. [2022-12-13 00:36:47,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 152 transitions, 1183 flow [2022-12-13 00:36:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:36:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:36:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2022-12-13 00:36:47,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 00:36:47,853 INFO L175 Difference]: Start difference. First operand has 63 places, 80 transitions, 543 flow. Second operand 7 states and 210 transitions. [2022-12-13 00:36:47,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 152 transitions, 1183 flow [2022-12-13 00:36:48,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 152 transitions, 1009 flow, removed 74 selfloop flow, removed 4 redundant places. [2022-12-13 00:36:48,447 INFO L231 Difference]: Finished difference. Result has 66 places, 93 transitions, 699 flow [2022-12-13 00:36:48,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=699, PETRI_PLACES=66, PETRI_TRANSITIONS=93} [2022-12-13 00:36:48,448 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2022-12-13 00:36:48,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:48,448 INFO L89 Accepts]: Start accepts. Operand has 66 places, 93 transitions, 699 flow [2022-12-13 00:36:48,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:48,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:48,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 93 transitions, 699 flow [2022-12-13 00:36:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 93 transitions, 699 flow [2022-12-13 00:36:48,740 INFO L130 PetriNetUnfolder]: 1979/3673 cut-off events. [2022-12-13 00:36:48,740 INFO L131 PetriNetUnfolder]: For 5859/7608 co-relation queries the response was YES. [2022-12-13 00:36:48,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17216 conditions, 3673 events. 1979/3673 cut-off events. For 5859/7608 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 29201 event pairs, 222 based on Foata normal form. 1/1884 useless extension candidates. Maximal degree in co-relation 17199. Up to 2917 conditions per place. [2022-12-13 00:36:48,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 93 transitions, 699 flow [2022-12-13 00:36:48,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 1892 [2022-12-13 00:36:53,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:36:53,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5437 [2022-12-13 00:36:53,885 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 92 transitions, 689 flow [2022-12-13 00:36:53,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:53,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:53,886 INFO L214 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] [2022-12-13 00:36:53,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:36:53,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:36:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2071326281, now seen corresponding path program 1 times [2022-12-13 00:36:53,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:53,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026760193] [2022-12-13 00:36:53,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:53,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026760193] [2022-12-13 00:36:54,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026760193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:54,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:54,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:36:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674154039] [2022-12-13 00:36:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:54,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:36:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:36:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:36:54,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:36:54,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 92 transitions, 689 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:54,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:54,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:36:54,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:55,416 INFO L130 PetriNetUnfolder]: 10700/16803 cut-off events. [2022-12-13 00:36:55,416 INFO L131 PetriNetUnfolder]: For 28597/29841 co-relation queries the response was YES. [2022-12-13 00:36:55,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71350 conditions, 16803 events. 10700/16803 cut-off events. For 28597/29841 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 114762 event pairs, 958 based on Foata normal form. 821/14450 useless extension candidates. Maximal degree in co-relation 71330. Up to 8629 conditions per place. [2022-12-13 00:36:55,515 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 127 selfloop transitions, 11 changer transitions 20/180 dead transitions. [2022-12-13 00:36:55,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 180 transitions, 1472 flow [2022-12-13 00:36:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:36:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:36:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-12-13 00:36:55,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6625 [2022-12-13 00:36:55,517 INFO L175 Difference]: Start difference. First operand has 66 places, 92 transitions, 689 flow. Second operand 6 states and 159 transitions. [2022-12-13 00:36:55,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 180 transitions, 1472 flow [2022-12-13 00:36:56,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 180 transitions, 1225 flow, removed 84 selfloop flow, removed 4 redundant places. [2022-12-13 00:36:56,318 INFO L231 Difference]: Finished difference. Result has 67 places, 85 transitions, 484 flow [2022-12-13 00:36:56,319 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=484, PETRI_PLACES=67, PETRI_TRANSITIONS=85} [2022-12-13 00:36:56,319 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -16 predicate places. [2022-12-13 00:36:56,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:56,319 INFO L89 Accepts]: Start accepts. Operand has 67 places, 85 transitions, 484 flow [2022-12-13 00:36:56,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:56,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:56,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 85 transitions, 484 flow [2022-12-13 00:36:56,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 85 transitions, 484 flow [2022-12-13 00:36:56,559 INFO L130 PetriNetUnfolder]: 2826/5161 cut-off events. [2022-12-13 00:36:56,559 INFO L131 PetriNetUnfolder]: For 5581/5635 co-relation queries the response was YES. [2022-12-13 00:36:56,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19740 conditions, 5161 events. 2826/5161 cut-off events. For 5581/5635 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 41331 event pairs, 389 based on Foata normal form. 1/2532 useless extension candidates. Maximal degree in co-relation 19722. Up to 3160 conditions per place. [2022-12-13 00:36:56,600 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 85 transitions, 484 flow [2022-12-13 00:36:56,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 1700 [2022-12-13 00:36:56,748 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L770: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [360] L755-->L758: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 00:36:56,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L770: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [380] L828-->L831: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 00:36:56,783 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L770: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [373] L808-->L811: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 00:36:56,978 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:36:56,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 660 [2022-12-13 00:36:56,979 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 84 transitions, 486 flow [2022-12-13 00:36:56,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:56,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:36:56,979 INFO L214 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] [2022-12-13 00:36:56,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:36:56,979 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:36:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:36:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1808111961, now seen corresponding path program 1 times [2022-12-13 00:36:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:36:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390918514] [2022-12-13 00:36:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:36:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:36:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:36:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:36:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:36:57,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390918514] [2022-12-13 00:36:57,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390918514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:36:57,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:36:57,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:36:57,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73735033] [2022-12-13 00:36:57,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:36:57,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:36:57,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:36:57,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:36:57,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:36:57,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2022-12-13 00:36:57,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 84 transitions, 486 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:36:57,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:36:57,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2022-12-13 00:36:57,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:58,936 INFO L130 PetriNetUnfolder]: 15921/25134 cut-off events. [2022-12-13 00:36:58,936 INFO L131 PetriNetUnfolder]: For 38321/40073 co-relation queries the response was YES. [2022-12-13 00:36:58,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96023 conditions, 25134 events. 15921/25134 cut-off events. For 38321/40073 co-relation queries the response was YES. Maximal size of possible extension queue 1232. Compared 184650 event pairs, 1819 based on Foata normal form. 1099/21099 useless extension candidates. Maximal degree in co-relation 96002. Up to 12936 conditions per place. [2022-12-13 00:36:59,047 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 127 selfloop transitions, 12 changer transitions 26/187 dead transitions. [2022-12-13 00:36:59,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 187 transitions, 1349 flow [2022-12-13 00:36:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:36:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:36:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-12-13 00:36:59,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-13 00:36:59,048 INFO L175 Difference]: Start difference. First operand has 66 places, 84 transitions, 486 flow. Second operand 6 states and 162 transitions. [2022-12-13 00:36:59,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 187 transitions, 1349 flow [2022-12-13 00:36:59,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 187 transitions, 1336 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:36:59,471 INFO L231 Difference]: Finished difference. Result has 73 places, 87 transitions, 529 flow [2022-12-13 00:36:59,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=529, PETRI_PLACES=73, PETRI_TRANSITIONS=87} [2022-12-13 00:36:59,472 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -10 predicate places. [2022-12-13 00:36:59,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:59,472 INFO L89 Accepts]: Start accepts. Operand has 73 places, 87 transitions, 529 flow [2022-12-13 00:36:59,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:59,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:59,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 87 transitions, 529 flow [2022-12-13 00:36:59,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 87 transitions, 529 flow [2022-12-13 00:37:00,074 INFO L130 PetriNetUnfolder]: 5397/9514 cut-off events. [2022-12-13 00:37:00,075 INFO L131 PetriNetUnfolder]: For 12011/13351 co-relation queries the response was YES. [2022-12-13 00:37:00,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37180 conditions, 9514 events. 5397/9514 cut-off events. For 12011/13351 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 82054 event pairs, 684 based on Foata normal form. 1/4536 useless extension candidates. Maximal degree in co-relation 37158. Up to 6076 conditions per place. [2022-12-13 00:37:00,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 87 transitions, 529 flow [2022-12-13 00:37:00,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 1726 [2022-12-13 00:37:00,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L755: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~a~0_12 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [380] L828-->L831: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 00:37:00,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L755: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~a~0_12 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [373] L808-->L811: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 00:37:00,528 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:37:00,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1056 [2022-12-13 00:37:00,528 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 86 transitions, 537 flow [2022-12-13 00:37:00,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:00,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:00,529 INFO L214 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] [2022-12-13 00:37:00,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:37:00,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:00,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1508949036, now seen corresponding path program 1 times [2022-12-13 00:37:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:00,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375076248] [2022-12-13 00:37:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:00,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375076248] [2022-12-13 00:37:00,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375076248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:00,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:00,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628024625] [2022-12-13 00:37:00,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:00,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:00,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2022-12-13 00:37:00,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 86 transitions, 537 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:00,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:00,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2022-12-13 00:37:00,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:03,695 INFO L130 PetriNetUnfolder]: 24350/38478 cut-off events. [2022-12-13 00:37:03,696 INFO L131 PetriNetUnfolder]: For 78028/80041 co-relation queries the response was YES. [2022-12-13 00:37:03,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158595 conditions, 38478 events. 24350/38478 cut-off events. For 78028/80041 co-relation queries the response was YES. Maximal size of possible extension queue 2130. Compared 304911 event pairs, 2642 based on Foata normal form. 1225/31576 useless extension candidates. Maximal degree in co-relation 158570. Up to 16676 conditions per place. [2022-12-13 00:37:03,980 INFO L137 encePairwiseOnDemand]: 34/46 looper letters, 110 selfloop transitions, 13 changer transitions 33/178 dead transitions. [2022-12-13 00:37:03,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 178 transitions, 1396 flow [2022-12-13 00:37:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-12-13 00:37:03,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5471014492753623 [2022-12-13 00:37:03,981 INFO L175 Difference]: Start difference. First operand has 72 places, 86 transitions, 537 flow. Second operand 6 states and 151 transitions. [2022-12-13 00:37:03,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 178 transitions, 1396 flow [2022-12-13 00:37:04,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 178 transitions, 1346 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:04,731 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 568 flow [2022-12-13 00:37:04,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2022-12-13 00:37:04,731 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -5 predicate places. [2022-12-13 00:37:04,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:04,732 INFO L89 Accepts]: Start accepts. Operand has 78 places, 89 transitions, 568 flow [2022-12-13 00:37:04,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:04,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:04,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 89 transitions, 568 flow [2022-12-13 00:37:04,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 89 transitions, 568 flow [2022-12-13 00:37:05,831 INFO L130 PetriNetUnfolder]: 10259/17298 cut-off events. [2022-12-13 00:37:05,832 INFO L131 PetriNetUnfolder]: For 20704/20999 co-relation queries the response was YES. [2022-12-13 00:37:05,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68708 conditions, 17298 events. 10259/17298 cut-off events. For 20704/20999 co-relation queries the response was YES. Maximal size of possible extension queue 2376. Compared 149352 event pairs, 1341 based on Foata normal form. 1/8185 useless extension candidates. Maximal degree in co-relation 68683. Up to 11557 conditions per place. [2022-12-13 00:37:06,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 89 transitions, 568 flow [2022-12-13 00:37:06,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 1718 [2022-12-13 00:37:06,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] $Ultimate##0-->L828: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_5 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_5, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [559] $Ultimate##0-->L811: Formula: (and (= v_~a~0_51 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~z~0_43 v_~__unbuffered_p2_EAX~0_102)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~z~0=v_~z~0_43, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_51, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~z~0=v_~z~0_43, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:37:06,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] $Ultimate##0-->L828: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_5 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_5, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [373] L808-->L811: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 00:37:06,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] $Ultimate##0-->L828: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_5 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_5, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [557] $Ultimate##0-->L758: Formula: (and (= v_~a~0_47 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_~x~0_50 v_~__unbuffered_p0_EAX~0_104) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_50} OutVars{~a~0=v_~a~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_50, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:37:06,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] $Ultimate##0-->L758: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_21| v_P3Thread1of1ForFork2_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~z~0_54 1) (= v_P3Thread1of1ForFork2_~arg.offset_21 |v_P3Thread1of1ForFork2_#in~arg.offset_21|) (= v_~x~0_56 v_~__unbuffered_p0_EAX~0_106) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~a~0_57 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_56, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_21|} OutVars{~a~0=v_~a~0_57, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_54, ~x~0=v_~x~0_56, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_21, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_21|} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P3Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork1_~arg.base] and [381] L831-->L834: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] [2022-12-13 00:37:06,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] $Ultimate##0-->L834: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_25| v_P3Thread1of1ForFork2_~arg.base_25) (= v_~a~0_59 v_~__unbuffered_p3_EBX~0_110) (= v_~a~0_59 1) (= v_P3Thread1of1ForFork2_~arg.offset_25 |v_P3Thread1of1ForFork2_#in~arg.offset_25|) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= v_~x~0_58 v_~__unbuffered_p0_EAX~0_108) (= v_~z~0_58 1) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_25|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x~0=v_~x~0_58, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_25|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_110, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_25, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_25|, ~a~0=v_~a~0_59, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_108, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_25|, ~z~0=v_~z~0_58, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P3Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p3_EBX~0, ~z~0, P3Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork1_~arg.base] and [380] L828-->L831: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 00:37:06,417 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:37:06,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1687 [2022-12-13 00:37:06,419 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 578 flow [2022-12-13 00:37:06,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:06,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:06,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:06,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:37:06,419 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1318194639, now seen corresponding path program 1 times [2022-12-13 00:37:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:06,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788687379] [2022-12-13 00:37:06,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:06,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788687379] [2022-12-13 00:37:06,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788687379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:06,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:06,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:37:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942443206] [2022-12-13 00:37:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:06,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:37:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:37:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:37:06,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2022-12-13 00:37:06,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 578 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:06,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:06,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2022-12-13 00:37:06,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:08,961 INFO L130 PetriNetUnfolder]: 18246/29113 cut-off events. [2022-12-13 00:37:08,961 INFO L131 PetriNetUnfolder]: For 31829/32511 co-relation queries the response was YES. [2022-12-13 00:37:09,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120794 conditions, 29113 events. 18246/29113 cut-off events. For 31829/32511 co-relation queries the response was YES. Maximal size of possible extension queue 1752. Compared 233610 event pairs, 431 based on Foata normal form. 2689/18833 useless extension candidates. Maximal degree in co-relation 120766. Up to 13267 conditions per place. [2022-12-13 00:37:09,040 INFO L137 encePairwiseOnDemand]: 33/48 looper letters, 30 selfloop transitions, 49 changer transitions 53/140 dead transitions. [2022-12-13 00:37:09,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 140 transitions, 1091 flow [2022-12-13 00:37:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:37:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:37:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2022-12-13 00:37:09,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-13 00:37:09,042 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 578 flow. Second operand 8 states and 208 transitions. [2022-12-13 00:37:09,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 140 transitions, 1091 flow [2022-12-13 00:37:09,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 140 transitions, 1007 flow, removed 36 selfloop flow, removed 3 redundant places. [2022-12-13 00:37:09,994 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 532 flow [2022-12-13 00:37:09,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2022-12-13 00:37:09,996 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2022-12-13 00:37:09,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:09,996 INFO L89 Accepts]: Start accepts. Operand has 84 places, 73 transitions, 532 flow [2022-12-13 00:37:09,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:09,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:09,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 73 transitions, 532 flow [2022-12-13 00:37:09,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 73 transitions, 532 flow [2022-12-13 00:37:10,053 INFO L130 PetriNetUnfolder]: 678/1325 cut-off events. [2022-12-13 00:37:10,053 INFO L131 PetriNetUnfolder]: For 1218/1364 co-relation queries the response was YES. [2022-12-13 00:37:10,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5992 conditions, 1325 events. 678/1325 cut-off events. For 1218/1364 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8159 event pairs, 3 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 5965. Up to 811 conditions per place. [2022-12-13 00:37:10,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 73 transitions, 532 flow [2022-12-13 00:37:10,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-13 00:37:10,556 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:37:10,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 561 [2022-12-13 00:37:10,557 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 522 flow [2022-12-13 00:37:10,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:10,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:10,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:10,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:37:10,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:10,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1573783250, now seen corresponding path program 1 times [2022-12-13 00:37:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:10,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481257061] [2022-12-13 00:37:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:10,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481257061] [2022-12-13 00:37:10,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481257061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:10,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:10,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574800685] [2022-12-13 00:37:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:10,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:10,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:10,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:10,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:37:10,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 522 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:10,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:10,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:37:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:11,367 INFO L130 PetriNetUnfolder]: 3474/5415 cut-off events. [2022-12-13 00:37:11,368 INFO L131 PetriNetUnfolder]: For 16337/16812 co-relation queries the response was YES. [2022-12-13 00:37:11,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25774 conditions, 5415 events. 3474/5415 cut-off events. For 16337/16812 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 33183 event pairs, 109 based on Foata normal form. 224/4062 useless extension candidates. Maximal degree in co-relation 25744. Up to 2665 conditions per place. [2022-12-13 00:37:11,395 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 68 selfloop transitions, 8 changer transitions 65/160 dead transitions. [2022-12-13 00:37:11,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 160 transitions, 1483 flow [2022-12-13 00:37:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-13 00:37:11,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.609375 [2022-12-13 00:37:11,397 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 522 flow. Second operand 6 states and 117 transitions. [2022-12-13 00:37:11,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 160 transitions, 1483 flow [2022-12-13 00:37:11,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 160 transitions, 1126 flow, removed 66 selfloop flow, removed 13 redundant places. [2022-12-13 00:37:11,625 INFO L231 Difference]: Finished difference. Result has 66 places, 73 transitions, 405 flow [2022-12-13 00:37:11,625 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=66, PETRI_TRANSITIONS=73} [2022-12-13 00:37:11,626 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2022-12-13 00:37:11,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:11,626 INFO L89 Accepts]: Start accepts. Operand has 66 places, 73 transitions, 405 flow [2022-12-13 00:37:11,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:11,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:11,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 73 transitions, 405 flow [2022-12-13 00:37:11,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 73 transitions, 405 flow [2022-12-13 00:37:11,749 INFO L130 PetriNetUnfolder]: 2184/3381 cut-off events. [2022-12-13 00:37:11,749 INFO L131 PetriNetUnfolder]: For 1711/1717 co-relation queries the response was YES. [2022-12-13 00:37:11,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 3381 events. 2184/3381 cut-off events. For 1711/1717 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 20822 event pairs, 3 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 9499. Up to 1621 conditions per place. [2022-12-13 00:37:11,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 73 transitions, 405 flow [2022-12-13 00:37:11,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 834 [2022-12-13 00:37:11,930 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:11,931 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-13 00:37:11,931 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 411 flow [2022-12-13 00:37:11,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:11,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:11,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:11,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:37:11,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1955647195, now seen corresponding path program 1 times [2022-12-13 00:37:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:11,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349828235] [2022-12-13 00:37:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:12,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349828235] [2022-12-13 00:37:12,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349828235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:12,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:12,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651798248] [2022-12-13 00:37:12,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:12,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:12,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:12,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:37:12,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:12,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:12,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:37:12,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:12,973 INFO L130 PetriNetUnfolder]: 3965/6184 cut-off events. [2022-12-13 00:37:12,974 INFO L131 PetriNetUnfolder]: For 9628/9903 co-relation queries the response was YES. [2022-12-13 00:37:12,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22334 conditions, 6184 events. 3965/6184 cut-off events. For 9628/9903 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 38318 event pairs, 413 based on Foata normal form. 212/4520 useless extension candidates. Maximal degree in co-relation 22310. Up to 2416 conditions per place. [2022-12-13 00:37:12,995 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 49 selfloop transitions, 2 changer transitions 61/132 dead transitions. [2022-12-13 00:37:12,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 132 transitions, 963 flow [2022-12-13 00:37:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 00:37:12,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 00:37:12,997 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 411 flow. Second operand 5 states and 90 transitions. [2022-12-13 00:37:12,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 132 transitions, 963 flow [2022-12-13 00:37:13,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 132 transitions, 957 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 00:37:13,270 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 386 flow [2022-12-13 00:37:13,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2022-12-13 00:37:13,271 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -13 predicate places. [2022-12-13 00:37:13,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:13,271 INFO L89 Accepts]: Start accepts. Operand has 70 places, 69 transitions, 386 flow [2022-12-13 00:37:13,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:13,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:13,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 69 transitions, 386 flow [2022-12-13 00:37:13,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 69 transitions, 386 flow [2022-12-13 00:37:13,334 INFO L130 PetriNetUnfolder]: 851/1482 cut-off events. [2022-12-13 00:37:13,334 INFO L131 PetriNetUnfolder]: For 1626/1629 co-relation queries the response was YES. [2022-12-13 00:37:13,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 1482 events. 851/1482 cut-off events. For 1626/1629 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 9261 event pairs, 3 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 4446. Up to 730 conditions per place. [2022-12-13 00:37:13,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 69 transitions, 386 flow [2022-12-13 00:37:13,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 00:37:13,346 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:13,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 00:37:13,347 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 386 flow [2022-12-13 00:37:13,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:13,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:13,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:13,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:37:13,347 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1478897436, now seen corresponding path program 2 times [2022-12-13 00:37:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:13,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614491773] [2022-12-13 00:37:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:37:13,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:37:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:37:13,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:37:13,417 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:37:13,418 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 00:37:13,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 00:37:13,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 00:37:13,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 00:37:13,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 00:37:13,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 00:37:13,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 00:37:13,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:37:13,420 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:13,424 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:37:13,424 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:37:13,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:37:13 BasicIcfg [2022-12-13 00:37:13,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:37:13,500 INFO L158 Benchmark]: Toolchain (without parser) took 49959.66ms. Allocated memory was 239.1MB in the beginning and 4.7GB in the end (delta: 4.4GB). Free memory was 213.4MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-13 00:37:13,500 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 239.1MB. Free memory is still 215.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:37:13,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.66ms. Allocated memory is still 239.1MB. Free memory was 213.4MB in the beginning and 185.9MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:37:13,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.55ms. Allocated memory is still 239.1MB. Free memory was 185.9MB in the beginning and 183.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:13,500 INFO L158 Benchmark]: Boogie Preprocessor took 21.66ms. Allocated memory is still 239.1MB. Free memory was 183.2MB in the beginning and 181.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:13,500 INFO L158 Benchmark]: RCFGBuilder took 537.20ms. Allocated memory is still 239.1MB. Free memory was 181.1MB in the beginning and 147.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-13 00:37:13,501 INFO L158 Benchmark]: TraceAbstraction took 48925.92ms. Allocated memory was 239.1MB in the beginning and 4.7GB in the end (delta: 4.4GB). Free memory was 146.5MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-13 00:37:13,501 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 239.1MB. Free memory is still 215.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 435.66ms. Allocated memory is still 239.1MB. Free memory was 213.4MB in the beginning and 185.9MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.55ms. Allocated memory is still 239.1MB. Free memory was 185.9MB in the beginning and 183.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.66ms. Allocated memory is still 239.1MB. Free memory was 183.2MB in the beginning and 181.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 537.20ms. Allocated memory is still 239.1MB. Free memory was 181.1MB in the beginning and 147.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 48925.92ms. Allocated memory was 239.1MB in the beginning and 4.7GB in the end (delta: 4.4GB). Free memory was 146.5MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 137 PlacesBefore, 83 PlacesAfterwards, 126 TransitionsBefore, 71 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 5589, independent unconditional: 0, dependent: 149, dependent conditional: 149, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2731, independent: 2681, independent conditional: 0, independent unconditional: 2681, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2731, independent: 2635, independent conditional: 0, independent unconditional: 2635, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5738, independent: 2908, independent conditional: 0, independent unconditional: 2908, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 2731, unknown conditional: 0, unknown unconditional: 2731] , Statistics on independence cache: Total cache size (in pairs): 5388, Positive cache size: 5338, Positive conditional cache size: 0, Positive unconditional cache size: 5338, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 1000 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 457, independent: 413, independent conditional: 413, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 457, independent: 413, independent conditional: 11, independent unconditional: 402, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 457, independent: 413, independent conditional: 11, independent unconditional: 402, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 457, independent: 413, independent conditional: 11, independent unconditional: 402, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 372, independent conditional: 11, independent unconditional: 361, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 187, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 123, dependent conditional: 7, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 457, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 402, unknown conditional: 12, unknown unconditional: 390] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 372, Positive conditional cache size: 11, Positive unconditional cache size: 361, Negative cache size: 30, Negative conditional cache size: 1, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1024 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, independent: 274, independent conditional: 274, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 299, independent: 274, independent conditional: 15, independent unconditional: 259, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 299, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 299, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 299, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 47, unknown conditional: 0, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 449, Positive cache size: 414, Positive conditional cache size: 11, Positive unconditional cache size: 403, Negative cache size: 35, Negative conditional cache size: 1, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 307, independent: 281, independent conditional: 281, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 307, independent: 281, independent conditional: 15, independent unconditional: 266, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 307, independent: 281, independent conditional: 0, independent unconditional: 281, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 307, independent: 281, independent conditional: 0, independent unconditional: 281, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 307, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 455, Positive cache size: 420, Positive conditional cache size: 11, Positive unconditional cache size: 409, Negative cache size: 35, Negative conditional cache size: 1, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 59 PlacesBefore, 59 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 1528 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1021, independent: 963, independent conditional: 963, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1021, independent: 963, independent conditional: 427, independent unconditional: 536, dependent: 58, dependent conditional: 12, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1021, independent: 963, independent conditional: 403, independent unconditional: 560, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1021, independent: 963, independent conditional: 403, independent unconditional: 560, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 14, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1021, independent: 938, independent conditional: 389, independent unconditional: 549, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 25, unknown conditional: 14, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 445, Positive conditional cache size: 25, Positive unconditional cache size: 420, Negative cache size: 35, Negative conditional cache size: 1, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 63 PlacesBefore, 63 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 1868 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 687, independent: 617, independent conditional: 617, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 687, independent: 617, independent conditional: 273, independent unconditional: 344, dependent: 70, dependent conditional: 12, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 687, independent: 617, independent conditional: 249, independent unconditional: 368, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 687, independent: 617, independent conditional: 249, independent unconditional: 368, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 687, independent: 609, independent conditional: 241, independent unconditional: 368, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 453, Positive conditional cache size: 33, Positive unconditional cache size: 420, Negative cache size: 35, Negative conditional cache size: 1, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 66 PlacesBefore, 66 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 1892 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 759, independent: 677, independent conditional: 677, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 759, independent: 677, independent conditional: 297, independent unconditional: 380, dependent: 82, dependent conditional: 12, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 759, independent: 677, independent conditional: 273, independent unconditional: 404, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 759, independent: 677, independent conditional: 273, independent unconditional: 404, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 759, independent: 669, independent conditional: 265, independent unconditional: 404, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 461, Positive conditional cache size: 41, Positive unconditional cache size: 420, Negative cache size: 35, Negative conditional cache size: 1, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 67 PlacesBefore, 66 PlacesAfterwards, 85 TransitionsBefore, 84 TransitionsAfterwards, 1700 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 905, independent: 825, independent conditional: 825, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 905, independent: 825, independent conditional: 433, independent unconditional: 392, dependent: 80, dependent conditional: 9, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 914, independent: 825, independent conditional: 342, independent unconditional: 483, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 914, independent: 825, independent conditional: 342, independent unconditional: 483, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 34, independent conditional: 15, independent unconditional: 19, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 914, independent: 791, independent conditional: 327, independent unconditional: 464, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 36, unknown conditional: 15, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 585, Positive cache size: 548, Positive conditional cache size: 56, Positive unconditional cache size: 492, Negative cache size: 37, Negative conditional cache size: 1, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 109, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 73 PlacesBefore, 72 PlacesAfterwards, 87 TransitionsBefore, 86 TransitionsAfterwards, 1726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 934, independent: 863, independent conditional: 863, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 934, independent: 863, independent conditional: 555, independent unconditional: 308, dependent: 71, dependent conditional: 16, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 950, independent: 863, independent conditional: 500, independent unconditional: 363, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 950, independent: 863, independent conditional: 500, independent unconditional: 363, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 40, independent conditional: 34, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 950, independent: 823, independent conditional: 466, independent unconditional: 357, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 42, unknown conditional: 34, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 699, Positive cache size: 660, Positive conditional cache size: 91, Positive unconditional cache size: 569, Negative cache size: 39, Negative conditional cache size: 1, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 87, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 78 PlacesBefore, 77 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 1718 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1447, independent: 1340, independent conditional: 1340, independent unconditional: 0, dependent: 107, dependent conditional: 107, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1447, independent: 1340, independent conditional: 1031, independent unconditional: 309, dependent: 107, dependent conditional: 21, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1468, independent: 1340, independent conditional: 983, independent unconditional: 357, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1468, independent: 1340, independent conditional: 983, independent unconditional: 357, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 25, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1468, independent: 1308, independent conditional: 958, independent unconditional: 350, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 32, unknown conditional: 25, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 788, Positive cache size: 749, Positive conditional cache size: 119, Positive unconditional cache size: 630, Negative cache size: 39, Negative conditional cache size: 1, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 76 PlacesBefore, 71 PlacesAfterwards, 73 TransitionsBefore, 68 TransitionsAfterwards, 892 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 463, independent: 405, independent conditional: 405, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 463, independent: 405, independent conditional: 246, independent unconditional: 159, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 463, independent: 405, independent conditional: 246, independent unconditional: 159, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 463, independent: 405, independent conditional: 246, independent unconditional: 159, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 463, independent: 393, independent conditional: 243, independent unconditional: 150, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 16, unknown conditional: 3, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 869, Positive cache size: 826, Positive conditional cache size: 126, Positive unconditional cache size: 700, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 65 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 834 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 851, Positive conditional cache size: 133, Positive unconditional cache size: 718, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 324, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 324, independent: 312, independent conditional: 216, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 324, independent: 312, independent conditional: 216, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 324, independent: 312, independent conditional: 216, independent unconditional: 96, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 324, independent: 309, independent conditional: 216, independent unconditional: 93, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 897, Positive cache size: 854, Positive conditional cache size: 133, Positive unconditional cache size: 721, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-2, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-1, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=1, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 646 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1723 IncrementalHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 35 mSDtfsCounter, 1723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=699occurred in iteration=6, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 1502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:37:13,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...