/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/mix008_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:54:03,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:54:03,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:54:03,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:54:03,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:54:03,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:54:03,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:54:03,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:54:03,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:54:03,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:54:03,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:54:03,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:54:03,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:54:03,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:54:03,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:54:03,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:54:03,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:54:03,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:54:03,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:54:03,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:54:03,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:54:03,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:54:03,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:54:03,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:54:03,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:54:03,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:54:03,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:54:03,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:54:03,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:54:03,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:54:03,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:54:03,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:54:03,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:54:03,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:54:03,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:54:03,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:54:03,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:54:03,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:54:03,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:54:03,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:54:03,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:54:03,935 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-05 22:54:03,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:54:03,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:54:03,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:54:03,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:54:03,969 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:54:03,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:54:03,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:54:03,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:54:03,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:54:03,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:54:03,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:54:03,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:54:03,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:54:03,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:54:03,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:54:03,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:54:03,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:54:03,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:54:03,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:54:03,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:54:03,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:54:03,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:54:03,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:54:03,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:54:03,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:54:03,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:54:03,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:54:03,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:54:03,974 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-05 22:54:04,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:54:04,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:54:04,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:54:04,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:54:04,264 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:54:04,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:54:05,271 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:54:05,499 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:54:05,500 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:54:05,514 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc190fc68/d660460042a9412bb0767d3c1f5862de/FLAG57a0c66aa [2022-12-05 22:54:05,526 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc190fc68/d660460042a9412bb0767d3c1f5862de [2022-12-05 22:54:05,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:54:05,530 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:54:05,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:54:05,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:54:05,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:54:05,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:54:05" (1/1) ... [2022-12-05 22:54:05,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695df31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:05, skipping insertion in model container [2022-12-05 22:54:05,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:54:05" (1/1) ... [2022-12-05 22:54:05,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:54:05,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:54:05,703 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 22:54:05,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:54:05,943 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:54:05,954 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 22:54:05,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:05,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:05,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:06,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:06,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:06,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:06,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:06,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:06,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:06,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:54:06,048 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:54:06,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06 WrapperNode [2022-12-05 22:54:06,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:54:06,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:54:06,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:54:06,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:54:06,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,127 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-05 22:54:06,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:54:06,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:54:06,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:54:06,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:54:06,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,160 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:54:06,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:54:06,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:54:06,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:54:06,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (1/1) ... [2022-12-05 22:54:06,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:54:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:54:06,212 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-05 22:54:06,225 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-05 22:54:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:54:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:54:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:54:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:54:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:54:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:54:06,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:54:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:54:06,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:54:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:54:06,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:54:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 22:54:06,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 22:54:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:54:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:54:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:54:06,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:54:06,253 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:54:06,439 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:54:06,441 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:54:06,801 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:54:06,928 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:54:06,928 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:54:06,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:54:06 BoogieIcfgContainer [2022-12-05 22:54:06,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:54:06,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:54:06,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:54:06,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:54:06,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:54:05" (1/3) ... [2022-12-05 22:54:06,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3bb96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:54:06, skipping insertion in model container [2022-12-05 22:54:06,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:06" (2/3) ... [2022-12-05 22:54:06,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3bb96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:54:06, skipping insertion in model container [2022-12-05 22:54:06,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:54:06" (3/3) ... [2022-12-05 22:54:06,941 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:54:06,959 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:54:06,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:54:06,960 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:54:07,018 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:54:07,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 22:54:07,152 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 22:54:07,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:07,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 22:54:07,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 22:54:07,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-05 22:54:07,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:07,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 22:54:07,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-05 22:54:07,249 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 22:54:07,250 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:07,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 22:54:07,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 22:54:07,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 3286 [2022-12-05 22:54:12,488 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-05 22:54:12,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:54:12,506 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;@3728a5c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:54:12,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 22:54:12,512 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 22:54:12,512 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:12,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:12,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 22:54:12,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:12,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:12,518 INFO L85 PathProgramCache]: Analyzing trace with hash 555174, now seen corresponding path program 1 times [2022-12-05 22:54:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:12,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92314532] [2022-12-05 22:54:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:12,927 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-05 22:54:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:12,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92314532] [2022-12-05 22:54:12,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92314532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:12,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:12,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:54:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182812287] [2022-12-05 22:54:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:12,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:54:12,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:54:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:54:12,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-05 22:54:12,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 22:54:12,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:12,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-05 22:54:12,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:14,067 INFO L130 PetriNetUnfolder]: 6050/8325 cut-off events. [2022-12-05 22:54:14,068 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-05 22:54:14,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16724 conditions, 8325 events. 6050/8325 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 42710 event pairs, 3098 based on Foata normal form. 0/7558 useless extension candidates. Maximal degree in co-relation 16712. Up to 6574 conditions per place. [2022-12-05 22:54:14,112 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-05 22:54:14,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 243 flow [2022-12-05 22:54:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-05 22:54:14,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2022-12-05 22:54:14,123 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 73 transitions. [2022-12-05 22:54:14,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 243 flow [2022-12-05 22:54:14,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 22:54:14,128 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 70 flow [2022-12-05 22:54:14,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-05 22:54:14,134 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-05 22:54:14,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:14,135 INFO L89 Accepts]: Start accepts. Operand has 45 places, 29 transitions, 70 flow [2022-12-05 22:54:14,137 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:14,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:14,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 29 transitions, 70 flow [2022-12-05 22:54:14,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2022-12-05 22:54:14,153 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-05 22:54:14,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:14,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:54:14,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2022-12-05 22:54:14,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-05 22:54:14,277 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:14,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-05 22:54:14,280 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2022-12-05 22:54:14,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 22:54:14,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:14,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:14,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:54:14,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:14,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash 722917844, now seen corresponding path program 1 times [2022-12-05 22:54:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:14,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770495162] [2022-12-05 22:54:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:14,558 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-05 22:54:14,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:14,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770495162] [2022-12-05 22:54:14,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770495162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:14,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:14,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:54:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527628709] [2022-12-05 22:54:14,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:14,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:54:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:54:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:54:14,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:54:14,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-05 22:54:14,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:14,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:54:14,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:17,169 INFO L130 PetriNetUnfolder]: 19829/26882 cut-off events. [2022-12-05 22:54:17,169 INFO L131 PetriNetUnfolder]: For 1227/1227 co-relation queries the response was YES. [2022-12-05 22:54:17,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55580 conditions, 26882 events. 19829/26882 cut-off events. For 1227/1227 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 144088 event pairs, 6979 based on Foata normal form. 760/27642 useless extension candidates. Maximal degree in co-relation 55570. Up to 16304 conditions per place. [2022-12-05 22:54:17,312 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2022-12-05 22:54:17,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2022-12-05 22:54:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-05 22:54:17,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-05 22:54:17,315 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 54 transitions. [2022-12-05 22:54:17,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2022-12-05 22:54:17,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:54:17,317 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 136 flow [2022-12-05 22:54:17,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-05 22:54:17,318 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-05 22:54:17,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:17,318 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 136 flow [2022-12-05 22:54:17,320 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:17,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:17,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 136 flow [2022-12-05 22:54:17,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 136 flow [2022-12-05 22:54:17,393 INFO L130 PetriNetUnfolder]: 394/947 cut-off events. [2022-12-05 22:54:17,394 INFO L131 PetriNetUnfolder]: For 116/144 co-relation queries the response was YES. [2022-12-05 22:54:17,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 947 events. 394/947 cut-off events. For 116/144 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6713 event pairs, 174 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1852. Up to 461 conditions per place. [2022-12-05 22:54:17,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 136 flow [2022-12-05 22:54:17,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-05 22:54:17,466 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:17,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-05 22:54:17,469 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 136 flow [2022-12-05 22:54:17,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-05 22:54:17,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:17,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:17,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:54:17,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:17,475 INFO L85 PathProgramCache]: Analyzing trace with hash 935616772, now seen corresponding path program 1 times [2022-12-05 22:54:17,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:17,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694034653] [2022-12-05 22:54:17,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:17,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:17,641 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-05 22:54:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694034653] [2022-12-05 22:54:17,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694034653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:17,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:17,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:54:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665711075] [2022-12-05 22:54:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:17,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:17,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:17,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:17,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:54:17,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 136 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 22:54:17,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:17,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:54:17,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:19,940 INFO L130 PetriNetUnfolder]: 18363/24910 cut-off events. [2022-12-05 22:54:19,940 INFO L131 PetriNetUnfolder]: For 11211/11211 co-relation queries the response was YES. [2022-12-05 22:54:19,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63528 conditions, 24910 events. 18363/24910 cut-off events. For 11211/11211 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 133120 event pairs, 3733 based on Foata normal form. 260/25170 useless extension candidates. Maximal degree in co-relation 63516. Up to 11521 conditions per place. [2022-12-05 22:54:20,079 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 64 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2022-12-05 22:54:20,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 388 flow [2022-12-05 22:54:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:54:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:54:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-05 22:54:20,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5775862068965517 [2022-12-05 22:54:20,082 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 136 flow. Second operand 4 states and 67 transitions. [2022-12-05 22:54:20,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 388 flow [2022-12-05 22:54:20,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:54:20,146 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2022-12-05 22:54:20,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-05 22:54:20,147 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-05 22:54:20,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:20,147 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 186 flow [2022-12-05 22:54:20,149 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:20,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:20,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 186 flow [2022-12-05 22:54:20,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 186 flow [2022-12-05 22:54:20,206 INFO L130 PetriNetUnfolder]: 272/700 cut-off events. [2022-12-05 22:54:20,206 INFO L131 PetriNetUnfolder]: For 324/388 co-relation queries the response was YES. [2022-12-05 22:54:20,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 700 events. 272/700 cut-off events. For 324/388 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4606 event pairs, 88 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 1556. Up to 324 conditions per place. [2022-12-05 22:54:20,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 186 flow [2022-12-05 22:54:20,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-05 22:54:20,238 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:20,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-05 22:54:20,240 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2022-12-05 22:54:20,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 22:54:20,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:20,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:20,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:54:20,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:20,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1789606242, now seen corresponding path program 1 times [2022-12-05 22:54:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:20,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577827303] [2022-12-05 22:54:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:20,386 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-05 22:54:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:20,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577827303] [2022-12-05 22:54:20,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577827303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:20,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:20,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:54:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936040208] [2022-12-05 22:54:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:20,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:20,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:20,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:54:20,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 22:54:20,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:20,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:54:20,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:22,121 INFO L130 PetriNetUnfolder]: 17311/23490 cut-off events. [2022-12-05 22:54:22,121 INFO L131 PetriNetUnfolder]: For 19812/19812 co-relation queries the response was YES. [2022-12-05 22:54:22,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63517 conditions, 23490 events. 17311/23490 cut-off events. For 19812/19812 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 119635 event pairs, 4643 based on Foata normal form. 200/23690 useless extension candidates. Maximal degree in co-relation 63502. Up to 10031 conditions per place. [2022-12-05 22:54:22,233 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 62 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2022-12-05 22:54:22,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 470 flow [2022-12-05 22:54:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:54:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:54:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-05 22:54:22,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5431034482758621 [2022-12-05 22:54:22,237 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 4 states and 63 transitions. [2022-12-05 22:54:22,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 470 flow [2022-12-05 22:54:22,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:54:22,260 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 324 flow [2022-12-05 22:54:22,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2022-12-05 22:54:22,262 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-05 22:54:22,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:22,262 INFO L89 Accepts]: Start accepts. Operand has 51 places, 51 transitions, 324 flow [2022-12-05 22:54:22,262 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:22,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:22,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 51 transitions, 324 flow [2022-12-05 22:54:22,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 51 transitions, 324 flow [2022-12-05 22:54:22,318 INFO L130 PetriNetUnfolder]: 230/598 cut-off events. [2022-12-05 22:54:22,318 INFO L131 PetriNetUnfolder]: For 894/987 co-relation queries the response was YES. [2022-12-05 22:54:22,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1738 conditions, 598 events. 230/598 cut-off events. For 894/987 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3721 event pairs, 66 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 1722. Up to 276 conditions per place. [2022-12-05 22:54:22,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 51 transitions, 324 flow [2022-12-05 22:54:22,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-05 22:54:22,338 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:22,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-05 22:54:22,343 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 324 flow [2022-12-05 22:54:22,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 22:54:22,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:22,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:22,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:54:22,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1994006247, now seen corresponding path program 1 times [2022-12-05 22:54:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:22,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310063671] [2022-12-05 22:54:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:22,504 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-05 22:54:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:22,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310063671] [2022-12-05 22:54:22,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310063671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:22,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:22,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:54:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668397478] [2022-12-05 22:54:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:22,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:22,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:54:22,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 324 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-05 22:54:22,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:22,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:54:22,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:24,326 INFO L130 PetriNetUnfolder]: 17095/23194 cut-off events. [2022-12-05 22:54:24,326 INFO L131 PetriNetUnfolder]: For 36705/36705 co-relation queries the response was YES. [2022-12-05 22:54:24,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70335 conditions, 23194 events. 17095/23194 cut-off events. For 36705/36705 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 121968 event pairs, 2944 based on Foata normal form. 32/23226 useless extension candidates. Maximal degree in co-relation 70316. Up to 13129 conditions per place. [2022-12-05 22:54:24,478 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 65 selfloop transitions, 30 changer transitions 0/95 dead transitions. [2022-12-05 22:54:24,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 683 flow [2022-12-05 22:54:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:54:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:54:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-05 22:54:24,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.646551724137931 [2022-12-05 22:54:24,481 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 324 flow. Second operand 4 states and 75 transitions. [2022-12-05 22:54:24,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 683 flow [2022-12-05 22:54:24,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 677 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:54:24,524 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 496 flow [2022-12-05 22:54:24,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=496, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2022-12-05 22:54:24,528 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2022-12-05 22:54:24,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:24,528 INFO L89 Accepts]: Start accepts. Operand has 55 places, 60 transitions, 496 flow [2022-12-05 22:54:24,529 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:24,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:24,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 60 transitions, 496 flow [2022-12-05 22:54:24,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 496 flow [2022-12-05 22:54:24,583 INFO L130 PetriNetUnfolder]: 214/566 cut-off events. [2022-12-05 22:54:24,584 INFO L131 PetriNetUnfolder]: For 1441/1671 co-relation queries the response was YES. [2022-12-05 22:54:24,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 566 events. 214/566 cut-off events. For 1441/1671 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3551 event pairs, 48 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 1958. Up to 256 conditions per place. [2022-12-05 22:54:24,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 60 transitions, 496 flow [2022-12-05 22:54:24,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 868 [2022-12-05 22:54:24,598 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:24,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-05 22:54:24,599 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 496 flow [2022-12-05 22:54:24,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-05 22:54:24,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:24,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:24,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:54:24,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash 268981995, now seen corresponding path program 1 times [2022-12-05 22:54:24,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:24,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875489226] [2022-12-05 22:54:24,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:24,780 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-05 22:54:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:24,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875489226] [2022-12-05 22:54:24,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875489226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:24,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:24,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:54:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783181352] [2022-12-05 22:54:24,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:24,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:24,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:24,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 22:54:24,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 496 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-05 22:54:24,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:24,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 22:54:24,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:26,498 INFO L130 PetriNetUnfolder]: 10508/15622 cut-off events. [2022-12-05 22:54:26,499 INFO L131 PetriNetUnfolder]: For 27428/29161 co-relation queries the response was YES. [2022-12-05 22:54:26,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45592 conditions, 15622 events. 10508/15622 cut-off events. For 27428/29161 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 101036 event pairs, 1629 based on Foata normal form. 1696/16819 useless extension candidates. Maximal degree in co-relation 45570. Up to 9139 conditions per place. [2022-12-05 22:54:26,591 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 100 selfloop transitions, 10 changer transitions 0/135 dead transitions. [2022-12-05 22:54:26,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 135 transitions, 1178 flow [2022-12-05 22:54:26,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:54:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:54:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-05 22:54:26,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6689655172413793 [2022-12-05 22:54:26,593 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 496 flow. Second operand 5 states and 97 transitions. [2022-12-05 22:54:26,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 135 transitions, 1178 flow [2022-12-05 22:54:26,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 135 transitions, 1178 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:54:26,616 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 571 flow [2022-12-05 22:54:26,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=571, PETRI_PLACES=62, PETRI_TRANSITIONS=69} [2022-12-05 22:54:26,617 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2022-12-05 22:54:26,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:26,617 INFO L89 Accepts]: Start accepts. Operand has 62 places, 69 transitions, 571 flow [2022-12-05 22:54:26,618 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:26,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:26,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 69 transitions, 571 flow [2022-12-05 22:54:26,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 69 transitions, 571 flow [2022-12-05 22:54:26,780 INFO L130 PetriNetUnfolder]: 999/2108 cut-off events. [2022-12-05 22:54:26,780 INFO L131 PetriNetUnfolder]: For 3200/4028 co-relation queries the response was YES. [2022-12-05 22:54:26,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6750 conditions, 2108 events. 999/2108 cut-off events. For 3200/4028 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 17343 event pairs, 399 based on Foata normal form. 37/1950 useless extension candidates. Maximal degree in co-relation 6726. Up to 1237 conditions per place. [2022-12-05 22:54:26,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 69 transitions, 571 flow [2022-12-05 22:54:26,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 1308 [2022-12-05 22:54:26,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] L876-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_153 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [521] L852-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_148 1) v_~__unbuffered_cnt~0_147) (= |v_P3Thread1of1ForFork1_#res.offset_31| 0) (= |v_P3Thread1of1ForFork1_#res.base_31| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_31|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] [2022-12-05 22:54:26,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] L876-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_153 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [476] L773-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-05 22:54:26,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] L876-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_153 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [471] L793-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-05 22:54:26,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] L876-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_153 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [481] L816-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_7| 0) (= |v_P2Thread1of1ForFork3_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_7|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-05 22:54:27,029 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:54:27,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 412 [2022-12-05 22:54:27,030 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 581 flow [2022-12-05 22:54:27,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-05 22:54:27,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:27,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:27,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:54:27,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1925953604, now seen corresponding path program 1 times [2022-12-05 22:54:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:27,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084551455] [2022-12-05 22:54:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:27,174 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-05 22:54:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:27,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084551455] [2022-12-05 22:54:27,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084551455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:27,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:27,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:54:27,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944178012] [2022-12-05 22:54:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:27,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:27,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 22:54:27,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 581 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-05 22:54:27,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:27,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 22:54:27,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:29,297 INFO L130 PetriNetUnfolder]: 18825/26853 cut-off events. [2022-12-05 22:54:29,297 INFO L131 PetriNetUnfolder]: For 90324/90324 co-relation queries the response was YES. [2022-12-05 22:54:29,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108813 conditions, 26853 events. 18825/26853 cut-off events. For 90324/90324 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 161315 event pairs, 4748 based on Foata normal form. 168/27021 useless extension candidates. Maximal degree in co-relation 108786. Up to 12156 conditions per place. [2022-12-05 22:54:29,448 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 87 selfloop transitions, 30 changer transitions 19/136 dead transitions. [2022-12-05 22:54:29,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 1299 flow [2022-12-05 22:54:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:54:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:54:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-05 22:54:29,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2022-12-05 22:54:29,449 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 581 flow. Second operand 4 states and 89 transitions. [2022-12-05 22:54:29,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 136 transitions, 1299 flow [2022-12-05 22:54:29,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 136 transitions, 1262 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-05 22:54:29,584 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 786 flow [2022-12-05 22:54:29,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=786, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2022-12-05 22:54:29,585 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2022-12-05 22:54:29,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:29,585 INFO L89 Accepts]: Start accepts. Operand has 66 places, 72 transitions, 786 flow [2022-12-05 22:54:29,588 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:29,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:29,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 72 transitions, 786 flow [2022-12-05 22:54:29,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 72 transitions, 786 flow [2022-12-05 22:54:29,759 INFO L130 PetriNetUnfolder]: 1173/2374 cut-off events. [2022-12-05 22:54:29,759 INFO L131 PetriNetUnfolder]: For 4498/5133 co-relation queries the response was YES. [2022-12-05 22:54:29,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7732 conditions, 2374 events. 1173/2374 cut-off events. For 4498/5133 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 18909 event pairs, 552 based on Foata normal form. 5/2163 useless extension candidates. Maximal degree in co-relation 7704. Up to 1520 conditions per place. [2022-12-05 22:54:29,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 72 transitions, 786 flow [2022-12-05 22:54:29,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 1188 [2022-12-05 22:54:29,805 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:29,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-05 22:54:29,806 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 786 flow [2022-12-05 22:54:29,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-05 22:54:29,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:29,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:29,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:54:29,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1720047427, now seen corresponding path program 1 times [2022-12-05 22:54:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:29,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459691590] [2022-12-05 22:54:29,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:29,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:30,083 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-05 22:54:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:30,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459691590] [2022-12-05 22:54:30,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459691590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:30,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:30,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:54:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446782371] [2022-12-05 22:54:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:30,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:54:30,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:30,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:54:30,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:54:30,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 22:54:30,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 786 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-05 22:54:30,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:30,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 22:54:30,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:31,474 INFO L130 PetriNetUnfolder]: 8129/12699 cut-off events. [2022-12-05 22:54:31,474 INFO L131 PetriNetUnfolder]: For 37522/38856 co-relation queries the response was YES. [2022-12-05 22:54:31,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45865 conditions, 12699 events. 8129/12699 cut-off events. For 37522/38856 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 85210 event pairs, 1155 based on Foata normal form. 1457/13804 useless extension candidates. Maximal degree in co-relation 45834. Up to 4456 conditions per place. [2022-12-05 22:54:31,563 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 133 selfloop transitions, 14 changer transitions 5/181 dead transitions. [2022-12-05 22:54:31,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 181 transitions, 2066 flow [2022-12-05 22:54:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:54:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:54:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-05 22:54:31,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6839080459770115 [2022-12-05 22:54:31,564 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 786 flow. Second operand 6 states and 119 transitions. [2022-12-05 22:54:31,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 181 transitions, 2066 flow [2022-12-05 22:54:31,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 181 transitions, 2050 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 22:54:31,691 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 898 flow [2022-12-05 22:54:31,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2022-12-05 22:54:31,692 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2022-12-05 22:54:31,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:31,692 INFO L89 Accepts]: Start accepts. Operand has 72 places, 81 transitions, 898 flow [2022-12-05 22:54:31,694 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:31,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:31,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 81 transitions, 898 flow [2022-12-05 22:54:31,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 81 transitions, 898 flow [2022-12-05 22:54:31,846 INFO L130 PetriNetUnfolder]: 850/1978 cut-off events. [2022-12-05 22:54:31,846 INFO L131 PetriNetUnfolder]: For 6675/8284 co-relation queries the response was YES. [2022-12-05 22:54:31,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8916 conditions, 1978 events. 850/1978 cut-off events. For 6675/8284 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 16536 event pairs, 160 based on Foata normal form. 61/1945 useless extension candidates. Maximal degree in co-relation 8884. Up to 1350 conditions per place. [2022-12-05 22:54:31,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 81 transitions, 898 flow [2022-12-05 22:54:31,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 1680 [2022-12-05 22:54:31,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] L876-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_153 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [481] L816-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_7| 0) (= |v_P2Thread1of1ForFork3_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_7|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-05 22:54:31,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] L876-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_153 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [471] L793-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-05 22:54:31,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] L876-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_153 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [521] L852-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_148 1) v_~__unbuffered_cnt~0_147) (= |v_P3Thread1of1ForFork1_#res.offset_31| 0) (= |v_P3Thread1of1ForFork1_#res.base_31| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_31|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] [2022-12-05 22:54:31,969 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] L876-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_153 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [476] L773-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-05 22:54:32,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:54:32,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-05 22:54:32,054 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 80 transitions, 906 flow [2022-12-05 22:54:32,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-05 22:54:32,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:32,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:32,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:54:32,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1928080954, now seen corresponding path program 1 times [2022-12-05 22:54:32,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:32,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449179265] [2022-12-05 22:54:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:32,263 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-05 22:54:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:32,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449179265] [2022-12-05 22:54:32,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449179265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:32,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:32,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:54:32,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798549852] [2022-12-05 22:54:32,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:32,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:54:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:32,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:54:32,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:54:32,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 22:54:32,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 80 transitions, 906 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:32,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:32,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 22:54:32,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:33,319 INFO L130 PetriNetUnfolder]: 6003/9444 cut-off events. [2022-12-05 22:54:33,319 INFO L131 PetriNetUnfolder]: For 36819/37470 co-relation queries the response was YES. [2022-12-05 22:54:33,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41235 conditions, 9444 events. 6003/9444 cut-off events. For 36819/37470 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 61117 event pairs, 977 based on Foata normal form. 614/9770 useless extension candidates. Maximal degree in co-relation 41200. Up to 3477 conditions per place. [2022-12-05 22:54:33,379 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 22 changer transitions 21/197 dead transitions. [2022-12-05 22:54:33,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 197 transitions, 2265 flow [2022-12-05 22:54:33,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:54:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:54:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-05 22:54:33,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-05 22:54:33,381 INFO L175 Difference]: Start difference. First operand has 71 places, 80 transitions, 906 flow. Second operand 7 states and 143 transitions. [2022-12-05 22:54:33,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 197 transitions, 2265 flow [2022-12-05 22:54:34,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 197 transitions, 2181 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-05 22:54:34,004 INFO L231 Difference]: Finished difference. Result has 77 places, 89 transitions, 996 flow [2022-12-05 22:54:34,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=996, PETRI_PLACES=77, PETRI_TRANSITIONS=89} [2022-12-05 22:54:34,004 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2022-12-05 22:54:34,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:34,005 INFO L89 Accepts]: Start accepts. Operand has 77 places, 89 transitions, 996 flow [2022-12-05 22:54:34,006 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:34,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:34,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 89 transitions, 996 flow [2022-12-05 22:54:34,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 89 transitions, 996 flow [2022-12-05 22:54:34,115 INFO L130 PetriNetUnfolder]: 648/1536 cut-off events. [2022-12-05 22:54:34,115 INFO L131 PetriNetUnfolder]: For 6578/7140 co-relation queries the response was YES. [2022-12-05 22:54:34,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7264 conditions, 1536 events. 648/1536 cut-off events. For 6578/7140 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 12185 event pairs, 44 based on Foata normal form. 4/1458 useless extension candidates. Maximal degree in co-relation 7230. Up to 991 conditions per place. [2022-12-05 22:54:34,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 89 transitions, 996 flow [2022-12-05 22:54:34,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-05 22:54:34,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:54:34,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 436 [2022-12-05 22:54:34,440 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 986 flow [2022-12-05 22:54:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:34,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:34,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:34,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:54:34,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 583979691, now seen corresponding path program 1 times [2022-12-05 22:54:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:34,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172375752] [2022-12-05 22:54:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:34,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:34,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-05 22:54:34,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:34,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172375752] [2022-12-05 22:54:34,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172375752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:34,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:34,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:54:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813029881] [2022-12-05 22:54:34,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:34,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:54:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:34,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:54:34,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:54:34,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-05 22:54:34,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-05 22:54:34,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:34,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-05 22:54:34,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:35,734 INFO L130 PetriNetUnfolder]: 8430/12978 cut-off events. [2022-12-05 22:54:35,734 INFO L131 PetriNetUnfolder]: For 59792/60019 co-relation queries the response was YES. [2022-12-05 22:54:35,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55567 conditions, 12978 events. 8430/12978 cut-off events. For 59792/60019 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 82340 event pairs, 2754 based on Foata normal form. 132/12814 useless extension candidates. Maximal degree in co-relation 55530. Up to 6681 conditions per place. [2022-12-05 22:54:35,846 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 82 selfloop transitions, 6 changer transitions 30/133 dead transitions. [2022-12-05 22:54:35,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 133 transitions, 1595 flow [2022-12-05 22:54:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-05 22:54:35,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-05 22:54:35,848 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 986 flow. Second operand 3 states and 63 transitions. [2022-12-05 22:54:35,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 133 transitions, 1595 flow [2022-12-05 22:54:36,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 133 transitions, 1434 flow, removed 52 selfloop flow, removed 4 redundant places. [2022-12-05 22:54:36,257 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 782 flow [2022-12-05 22:54:36,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2022-12-05 22:54:36,257 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2022-12-05 22:54:36,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:36,257 INFO L89 Accepts]: Start accepts. Operand has 76 places, 78 transitions, 782 flow [2022-12-05 22:54:36,259 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:36,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:36,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 78 transitions, 782 flow [2022-12-05 22:54:36,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 78 transitions, 782 flow [2022-12-05 22:54:36,348 INFO L130 PetriNetUnfolder]: 613/1509 cut-off events. [2022-12-05 22:54:36,349 INFO L131 PetriNetUnfolder]: For 3994/4292 co-relation queries the response was YES. [2022-12-05 22:54:36,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 1509 events. 613/1509 cut-off events. For 3994/4292 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 12050 event pairs, 52 based on Foata normal form. 3/1409 useless extension candidates. Maximal degree in co-relation 5674. Up to 682 conditions per place. [2022-12-05 22:54:36,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 78 transitions, 782 flow [2022-12-05 22:54:36,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 1258 [2022-12-05 22:54:36,373 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:36,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-05 22:54:36,373 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 782 flow [2022-12-05 22:54:36,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-05 22:54:36,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:36,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:36,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:54:36,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2120968167, now seen corresponding path program 2 times [2022-12-05 22:54:36,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:36,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334379078] [2022-12-05 22:54:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:36,658 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-05 22:54:36,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334379078] [2022-12-05 22:54:36,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334379078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:36,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:36,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:54:36,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934018038] [2022-12-05 22:54:36,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:36,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:54:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:36,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:54:36,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:54:36,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 22:54:36,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 782 flow. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-05 22:54:36,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:36,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 22:54:36,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:38,104 INFO L130 PetriNetUnfolder]: 10288/15847 cut-off events. [2022-12-05 22:54:38,105 INFO L131 PetriNetUnfolder]: For 62879/62879 co-relation queries the response was YES. [2022-12-05 22:54:38,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64881 conditions, 15847 events. 10288/15847 cut-off events. For 62879/62879 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 100910 event pairs, 934 based on Foata normal form. 13/15860 useless extension candidates. Maximal degree in co-relation 64845. Up to 5574 conditions per place. [2022-12-05 22:54:38,199 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 94 selfloop transitions, 35 changer transitions 76/205 dead transitions. [2022-12-05 22:54:38,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 205 transitions, 2138 flow [2022-12-05 22:54:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:54:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:54:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-12-05 22:54:38,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-05 22:54:38,200 INFO L175 Difference]: Start difference. First operand has 76 places, 78 transitions, 782 flow. Second operand 6 states and 114 transitions. [2022-12-05 22:54:38,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 205 transitions, 2138 flow [2022-12-05 22:54:38,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 205 transitions, 2043 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:54:38,480 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 796 flow [2022-12-05 22:54:38,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=796, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2022-12-05 22:54:38,481 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places. [2022-12-05 22:54:38,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:38,481 INFO L89 Accepts]: Start accepts. Operand has 80 places, 74 transitions, 796 flow [2022-12-05 22:54:38,482 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:38,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:38,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 74 transitions, 796 flow [2022-12-05 22:54:38,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 74 transitions, 796 flow [2022-12-05 22:54:38,554 INFO L130 PetriNetUnfolder]: 424/1153 cut-off events. [2022-12-05 22:54:38,554 INFO L131 PetriNetUnfolder]: For 3531/3590 co-relation queries the response was YES. [2022-12-05 22:54:38,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4235 conditions, 1153 events. 424/1153 cut-off events. For 3531/3590 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8684 event pairs, 49 based on Foata normal form. 2/1100 useless extension candidates. Maximal degree in co-relation 4201. Up to 421 conditions per place. [2022-12-05 22:54:38,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 74 transitions, 796 flow [2022-12-05 22:54:38,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 918 [2022-12-05 22:54:38,575 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:38,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-05 22:54:38,577 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 796 flow [2022-12-05 22:54:38,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-05 22:54:38,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:38,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:38,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:54:38,577 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1421665209, now seen corresponding path program 3 times [2022-12-05 22:54:38,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:38,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932182958] [2022-12-05 22:54:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:38,830 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-05 22:54:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932182958] [2022-12-05 22:54:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932182958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:38,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:38,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 22:54:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234265201] [2022-12-05 22:54:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:54:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:38,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:54:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:54:38,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 22:54:38,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 796 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-05 22:54:38,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:38,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 22:54:38,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:39,634 INFO L130 PetriNetUnfolder]: 4166/6947 cut-off events. [2022-12-05 22:54:39,634 INFO L131 PetriNetUnfolder]: For 18817/19003 co-relation queries the response was YES. [2022-12-05 22:54:39,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25590 conditions, 6947 events. 4166/6947 cut-off events. For 18817/19003 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 46411 event pairs, 932 based on Foata normal form. 206/7031 useless extension candidates. Maximal degree in co-relation 25553. Up to 2695 conditions per place. [2022-12-05 22:54:39,661 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 52 selfloop transitions, 17 changer transitions 85/159 dead transitions. [2022-12-05 22:54:39,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 159 transitions, 1798 flow [2022-12-05 22:54:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:54:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:54:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-05 22:54:39,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2022-12-05 22:54:39,662 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 796 flow. Second operand 8 states and 131 transitions. [2022-12-05 22:54:39,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 159 transitions, 1798 flow [2022-12-05 22:54:39,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 159 transitions, 1729 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-05 22:54:39,845 INFO L231 Difference]: Finished difference. Result has 83 places, 41 transitions, 298 flow [2022-12-05 22:54:39,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=298, PETRI_PLACES=83, PETRI_TRANSITIONS=41} [2022-12-05 22:54:39,845 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2022-12-05 22:54:39,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:39,846 INFO L89 Accepts]: Start accepts. Operand has 83 places, 41 transitions, 298 flow [2022-12-05 22:54:39,846 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:39,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:39,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 41 transitions, 298 flow [2022-12-05 22:54:39,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 41 transitions, 298 flow [2022-12-05 22:54:39,854 INFO L130 PetriNetUnfolder]: 28/89 cut-off events. [2022-12-05 22:54:39,854 INFO L131 PetriNetUnfolder]: For 147/180 co-relation queries the response was YES. [2022-12-05 22:54:39,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 89 events. 28/89 cut-off events. For 147/180 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 257 event pairs, 2 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 317. Up to 28 conditions per place. [2022-12-05 22:54:39,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 41 transitions, 298 flow [2022-12-05 22:54:39,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-05 22:54:40,413 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 22:54:40,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 569 [2022-12-05 22:54:40,414 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 35 transitions, 274 flow [2022-12-05 22:54:40,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-05 22:54:40,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:40,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:40,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:54:40,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash 108958808, now seen corresponding path program 1 times [2022-12-05 22:54:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:40,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972609382] [2022-12-05 22:54:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:41,775 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-05 22:54:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:41,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972609382] [2022-12-05 22:54:41,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972609382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:41,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:41,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 22:54:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185557685] [2022-12-05 22:54:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:41,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:54:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:41,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:54:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:54:41,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:54:41,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 35 transitions, 274 flow. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-05 22:54:41,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:41,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:54:41,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:42,053 INFO L130 PetriNetUnfolder]: 660/1059 cut-off events. [2022-12-05 22:54:42,053 INFO L131 PetriNetUnfolder]: For 2706/2706 co-relation queries the response was YES. [2022-12-05 22:54:42,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1059 events. 660/1059 cut-off events. For 2706/2706 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4516 event pairs, 67 based on Foata normal form. 1/1060 useless extension candidates. Maximal degree in co-relation 4046. Up to 630 conditions per place. [2022-12-05 22:54:42,057 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 49 selfloop transitions, 4 changer transitions 30/83 dead transitions. [2022-12-05 22:54:42,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 752 flow [2022-12-05 22:54:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:54:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:54:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-12-05 22:54:42,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-05 22:54:42,058 INFO L175 Difference]: Start difference. First operand has 70 places, 35 transitions, 274 flow. Second operand 6 states and 54 transitions. [2022-12-05 22:54:42,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 752 flow [2022-12-05 22:54:42,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 546 flow, removed 42 selfloop flow, removed 23 redundant places. [2022-12-05 22:54:42,064 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 177 flow [2022-12-05 22:54:42,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2022-12-05 22:54:42,064 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2022-12-05 22:54:42,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:42,065 INFO L89 Accepts]: Start accepts. Operand has 53 places, 35 transitions, 177 flow [2022-12-05 22:54:42,065 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:42,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:42,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 35 transitions, 177 flow [2022-12-05 22:54:42,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 35 transitions, 177 flow [2022-12-05 22:54:42,073 INFO L130 PetriNetUnfolder]: 26/75 cut-off events. [2022-12-05 22:54:42,073 INFO L131 PetriNetUnfolder]: For 101/125 co-relation queries the response was YES. [2022-12-05 22:54:42,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 75 events. 26/75 cut-off events. For 101/125 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 194 event pairs, 0 based on Foata normal form. 6/78 useless extension candidates. Maximal degree in co-relation 200. Up to 24 conditions per place. [2022-12-05 22:54:42,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 35 transitions, 177 flow [2022-12-05 22:54:42,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-05 22:54:42,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] L766-->P0EXIT: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_596 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_239 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_162 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_515 256) 0)))) (.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= 0 (mod v_~a$w_buff0_used~0_597 256))) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_515) v_~a$w_buff1_used~0_514) (= |v_P0Thread1of1ForFork0_#res#1.base_35| 0) (= v_~a$r_buff1_thd1~0_161 (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_238 256) 0))) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_514 256) 0)))) 0 v_~a$r_buff1_thd1~0_162)) (= v_~__unbuffered_cnt~0_321 (+ v_~__unbuffered_cnt~0_322 1)) (= 0 |v_P0Thread1of1ForFork0_#res#1.offset_35|) (= v_~a~0_425 (ite .cse4 v_~a$w_buff0~0_360 (ite .cse1 v_~a$w_buff1~0_296 v_~a~0_426))) (= v_~a$r_buff0_thd1~0_238 (ite .cse0 0 v_~a$r_buff0_thd1~0_239)) (= (ite .cse4 0 v_~a$w_buff0_used~0_597) v_~a$w_buff0_used~0_596)))) InVars {~a~0=v_~a~0_426, ~a$w_buff1~0=v_~a$w_buff1~0_296, ~a$w_buff0~0=v_~a$w_buff0~0_360, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_162, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_597, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_322, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_239, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_515} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_35|, ~a~0=v_~a~0_425, ~a$w_buff1~0=v_~a$w_buff1~0_296, ~a$w_buff0~0=v_~a$w_buff0~0_360, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_35|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_161, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_596, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_321, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_238, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_514} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, ~a~0, P0Thread1of1ForFork0_#res#1.base, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [546] L876-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_536 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_169 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd0~0_163 256) 0)))) (let ((.cse0 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_457 256) 0)))) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_537 256) 0)) .cse5)) (.cse1 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_457) v_~a$w_buff1_used~0_456) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_57|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_57| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83| (mod v_~main$tmp_guard0~0_88 256)) (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53|) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EBX~0_102 0) (= v_~x~0_82 2) (= v_~y~0_102 2) (= v_~__unbuffered_p2_EBX~0_75 0) (= v_~__unbuffered_p3_EAX~0_70 1) (= 2 v_~__unbuffered_p2_EAX~0_71))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_60) (= v_~a~0_369 (ite .cse2 v_~a$w_buff0~0_332 (ite .cse0 v_~a$w_buff1~0_274 v_~a~0_370))) (= v_~main$tmp_guard0~0_88 (ite (= (ite (= v_~__unbuffered_cnt~0_315 4) 1 0) 0) 0 1)) (= v_~a$r_buff1_thd0~0_162 (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd0~0_168 256) 0))) (and (not (= 0 (mod v_~a$w_buff1_used~0_456 256))) .cse4)) 0 v_~a$r_buff1_thd0~0_163)) (= v_~a$w_buff0_used~0_536 (ite .cse2 0 v_~a$w_buff0_used~0_537)) (= v_~a$r_buff0_thd0~0_168 (ite .cse1 0 v_~a$r_buff0_thd0~0_169))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_537, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_102, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_169, ~a~0=v_~a~0_370, ~a$w_buff1~0=v_~a$w_buff1~0_274, ~a$w_buff0~0=v_~a$w_buff0~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_315, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_457, ~y~0=v_~y~0_102, ~x~0=v_~x~0_82} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_57|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_75, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_71|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_536, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_102, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_168, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_88, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_59|, ~a~0=v_~a~0_369, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53|, ~a$w_buff1~0=v_~a$w_buff1~0_274, ~a$w_buff0~0=v_~a$w_buff0~0_332, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_103|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_162, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_315, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_456, ~y~0=v_~y~0_102, ~x~0=v_~x~0_82, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 22:54:43,457 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:54:43,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1393 [2022-12-05 22:54:43,458 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 171 flow [2022-12-05 22:54:43,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-05 22:54:43,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:43,458 INFO L213 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-05 22:54:43,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 22:54:43,458 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1739891171, now seen corresponding path program 1 times [2022-12-05 22:54:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:43,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827575279] [2022-12-05 22:54:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:54:43,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:54:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:54:43,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:54:43,584 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:54:43,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 22:54:43,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 22:54:43,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 22:54:43,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 22:54:43,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 22:54:43,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 22:54:43,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 22:54:43,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 22:54:43,590 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:43,594 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:54:43,594 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:54:43,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:54:43 BasicIcfg [2022-12-05 22:54:43,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:54:43,682 INFO L158 Benchmark]: Toolchain (without parser) took 38152.19ms. Allocated memory was 179.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 144.2MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-05 22:54:43,682 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:54:43,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.63ms. Allocated memory is still 179.3MB. Free memory was 144.0MB in the beginning and 115.7MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 22:54:43,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.21ms. Allocated memory is still 179.3MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:54:43,683 INFO L158 Benchmark]: Boogie Preprocessor took 45.65ms. Allocated memory is still 179.3MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:54:43,683 INFO L158 Benchmark]: RCFGBuilder took 756.84ms. Allocated memory is still 179.3MB. Free memory was 110.9MB in the beginning and 73.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-05 22:54:43,683 INFO L158 Benchmark]: TraceAbstraction took 36748.12ms. Allocated memory was 179.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 72.1MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-05 22:54:43,684 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.11ms. Allocated memory is still 179.3MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 518.63ms. Allocated memory is still 179.3MB. Free memory was 144.0MB in the beginning and 115.7MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.21ms. Allocated memory is still 179.3MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.65ms. Allocated memory is still 179.3MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 756.84ms. Allocated memory is still 179.3MB. Free memory was 110.9MB in the beginning and 73.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 36748.12ms. Allocated memory was 179.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 72.1MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 139 PlacesBefore, 49 PlacesAfterwards, 128 TransitionsBefore, 37 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2506, independent: 2430, independent conditional: 2430, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2506, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2506, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2506, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1911, independent: 1862, independent conditional: 0, independent unconditional: 1862, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1911, independent: 1839, independent conditional: 0, independent unconditional: 1839, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2506, independent: 568, independent conditional: 0, independent unconditional: 568, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 1911, unknown conditional: 0, unknown unconditional: 1911] , Statistics on independence cache: Total cache size (in pairs): 2814, Positive cache size: 2765, Positive conditional cache size: 0, Positive unconditional cache size: 2765, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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.1s, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 171, independent conditional: 171, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 203, independent: 171, independent conditional: 24, independent unconditional: 147, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 171, independent conditional: 24, independent unconditional: 147, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 171, independent conditional: 24, independent unconditional: 147, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 189, independent: 162, independent conditional: 23, independent unconditional: 139, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 189, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 109, dependent conditional: 64, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 189, unknown conditional: 33, unknown unconditional: 156] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 162, Positive conditional cache size: 23, Positive unconditional cache size: 139, Negative cache size: 27, Negative conditional cache size: 10, Negative unconditional cache size: 17, 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.1s, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 181, independent: 162, independent conditional: 26, independent unconditional: 136, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 181, independent: 162, independent conditional: 5, independent unconditional: 157, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 181, independent: 162, independent conditional: 5, independent unconditional: 157, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, independent: 142, independent conditional: 5, independent unconditional: 137, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 182, Positive conditional cache size: 23, Positive unconditional cache size: 159, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, 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, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 166, independent conditional: 166, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188, independent: 166, independent conditional: 15, independent unconditional: 151, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 185, Positive conditional cache size: 23, Positive unconditional cache size: 162, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 152, independent conditional: 16, independent unconditional: 136, dependent: 27, dependent conditional: 3, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 187, Positive conditional cache size: 23, Positive unconditional cache size: 164, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 868 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 355, independent: 315, independent conditional: 315, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 355, independent: 315, independent conditional: 74, independent unconditional: 241, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 355, independent: 315, independent conditional: 0, independent unconditional: 315, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 355, independent: 315, independent conditional: 0, independent unconditional: 315, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 355, independent: 315, independent conditional: 0, independent unconditional: 315, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 187, Positive conditional cache size: 23, Positive unconditional cache size: 164, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 74, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 62 PlacesBefore, 61 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 807, independent: 717, independent conditional: 717, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 807, independent: 717, independent conditional: 307, independent unconditional: 410, dependent: 90, dependent conditional: 29, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 865, independent: 717, independent conditional: 216, independent unconditional: 501, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 865, independent: 717, independent conditional: 216, independent unconditional: 501, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 9, independent unconditional: 7, 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: 20, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 54, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 865, independent: 701, independent conditional: 207, independent unconditional: 494, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 20, unknown conditional: 9, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 211, Positive conditional cache size: 32, Positive unconditional cache size: 179, Negative cache size: 42, Negative conditional cache size: 10, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 178, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 217, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 217, independent: 177, independent conditional: 74, independent unconditional: 103, dependent: 40, dependent conditional: 21, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 280, independent: 177, independent conditional: 12, independent unconditional: 165, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 280, independent: 177, independent conditional: 12, independent unconditional: 165, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 280, independent: 177, independent conditional: 12, independent unconditional: 165, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 211, Positive conditional cache size: 32, Positive unconditional cache size: 179, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 146, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 72 PlacesBefore, 71 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 1680 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 846, independent: 742, independent conditional: 742, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 846, independent: 742, independent conditional: 442, independent unconditional: 300, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 846, independent: 742, independent conditional: 202, independent unconditional: 540, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 846, independent: 742, independent conditional: 202, independent unconditional: 540, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 11, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 846, independent: 728, independent conditional: 191, independent unconditional: 537, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 14, unknown conditional: 11, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 235, Positive conditional cache size: 43, Positive unconditional cache size: 192, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 240, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 77 PlacesBefore, 77 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 796, independent: 684, independent conditional: 684, independent unconditional: 0, dependent: 112, dependent conditional: 112, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 796, independent: 684, independent conditional: 360, independent unconditional: 324, dependent: 112, dependent conditional: 20, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 856, independent: 684, independent conditional: 159, independent unconditional: 525, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 856, independent: 684, independent conditional: 159, independent unconditional: 525, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 8, independent unconditional: 2, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 856, independent: 674, independent conditional: 151, independent unconditional: 523, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 245, Positive conditional cache size: 51, Positive unconditional cache size: 194, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 281, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, independent: 313, independent conditional: 313, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 361, independent: 313, independent conditional: 167, independent unconditional: 146, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 361, independent: 313, independent conditional: 102, independent unconditional: 211, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 361, independent: 313, independent conditional: 102, independent unconditional: 211, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, 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: 361, independent: 307, independent conditional: 97, independent unconditional: 210, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 251, Positive conditional cache size: 56, Positive unconditional cache size: 195, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 65, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 187, independent: 150, independent conditional: 76, independent unconditional: 74, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 150, independent conditional: 46, independent unconditional: 104, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 150, independent conditional: 46, independent unconditional: 104, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 187, independent: 141, independent conditional: 37, independent unconditional: 104, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 260, Positive conditional cache size: 65, Positive unconditional cache size: 195, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 76 PlacesBefore, 70 PlacesAfterwards, 41 TransitionsBefore, 35 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 233, independent: 195, independent conditional: 195, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 233, independent: 195, independent conditional: 125, independent unconditional: 70, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 233, independent: 195, independent conditional: 115, independent unconditional: 80, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 233, independent: 195, independent conditional: 115, independent unconditional: 80, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 233, independent: 177, independent conditional: 106, independent unconditional: 71, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 19, unknown conditional: 9, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 347, Positive conditional cache size: 80, Positive unconditional cache size: 267, Negative cache size: 44, Negative conditional cache size: 10, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 52 PlacesBefore, 49 PlacesAfterwards, 35 TransitionsBefore, 30 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 228, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 228, independent: 198, independent conditional: 164, independent unconditional: 34, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 228, independent: 198, independent conditional: 149, independent unconditional: 49, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 228, independent: 198, independent conditional: 149, independent unconditional: 49, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 38, independent conditional: 27, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 222, independent: 148, independent conditional: 148, independent unconditional: 0, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, independent: 160, independent conditional: 122, independent unconditional: 38, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 45, unknown conditional: 27, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 499, Positive conditional cache size: 110, Positive unconditional cache size: 389, Negative cache size: 51, Negative conditional cache size: 10, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t209, ((void *)0), P0, ((void *)0))=-3, t209={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t210, ((void *)0), P1, ((void *)0))=-2, t209={5:0}, t210={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t211, ((void *)0), P2, ((void *)0))=-1, t209={5:0}, t210={6:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t212, ((void *)0), P3, ((void *)0))=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L782] 2 x = 2 [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L802] 3 y = 2 [L805] 3 __unbuffered_p2_EAX = y [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L825] 4 z = 1 [L828] 4 __unbuffered_p3_EAX = z [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=255, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=255, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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: 876]: 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: 872]: 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: 870]: 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: 874]: 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, 170 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: 36.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 579 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 579 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1466 IncrementalHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 45 mSDtfsCounter, 1466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=996occurred in iteration=9, InterpolantAutomatonStates: 63, 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.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-05 22:54:43,722 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...