/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:14:29,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:14:29,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:14:29,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:14:29,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:14:29,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:14:29,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:14:29,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:14:29,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:14:29,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:14:29,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:14:29,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:14:29,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:14:29,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:14:29,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:14:29,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:14:29,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:14:29,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:14:29,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:14:29,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:14:29,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:14:29,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:14:29,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:14:29,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:14:29,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:14:29,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:14:29,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:14:29,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:14:29,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:14:29,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:14:29,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:14:29,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:14:29,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:14:29,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:14:29,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:14:29,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:14:29,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:14:29,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:14:29,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:14:29,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:14:29,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:14:29,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:14:29,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:14:29,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:14:29,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:14:29,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:14:29,991 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:14:29,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:14:29,991 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:14:29,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:14:29,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:14:29,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:14:29,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:14:29,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:14:29,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:14:29,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:14:29,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:14:29,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:14:29,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:14:29,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:14:29,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:14:29,994 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:14:29,994 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:14:30,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:14:30,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:14:30,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:14:30,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:14:30,304 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:14:30,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i [2022-12-13 03:14:31,191 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:14:31,448 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:14:31,448 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i [2022-12-13 03:14:31,492 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8f83df6/bde2c47a342744409967ab16e490d716/FLAGb2816b387 [2022-12-13 03:14:31,502 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8f83df6/bde2c47a342744409967ab16e490d716 [2022-12-13 03:14:31,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:14:31,505 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:14:31,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:14:31,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:14:31,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:14:31,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:14:31" (1/1) ... [2022-12-13 03:14:31,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26296c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:31, skipping insertion in model container [2022-12-13 03:14:31,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:14:31" (1/1) ... [2022-12-13 03:14:31,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:14:31,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:14:31,719 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/safe012_power.oepc.i[995,1008] [2022-12-13 03:14:31,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:14:31,906 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:14:31,918 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/safe012_power.oepc.i[995,1008] [2022-12-13 03:14:31,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:14:31,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:14:31,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:14:32,003 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:14:32,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32 WrapperNode [2022-12-13 03:14:32,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:14:32,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:14:32,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:14:32,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:14:32,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,061 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 03:14:32,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:14:32,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:14:32,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:14:32,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:14:32,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,094 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:14:32,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:14:32,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:14:32,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:14:32,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (1/1) ... [2022-12-13 03:14:32,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:14:32,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:14:32,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:14:32,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:14:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:14:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:14:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:14:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:14:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:14:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:14:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:14:32,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:14:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:14:32,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:14:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:14:32,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:14:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:14:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:14:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:14:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:14:32,194 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:14:32,357 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:14:32,358 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:14:32,684 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:14:32,853 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:14:32,854 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:14:32,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:14:32 BoogieIcfgContainer [2022-12-13 03:14:32,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:14:32,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:14:32,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:14:32,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:14:32,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:14:31" (1/3) ... [2022-12-13 03:14:32,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2aa3b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:14:32, skipping insertion in model container [2022-12-13 03:14:32,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:32" (2/3) ... [2022-12-13 03:14:32,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2aa3b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:14:32, skipping insertion in model container [2022-12-13 03:14:32,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:14:32" (3/3) ... [2022-12-13 03:14:32,863 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.oepc.i [2022-12-13 03:14:32,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:14:32,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:14:32,877 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:14:32,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:14:32,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 03:14:33,025 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 03:14:33,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:14:33,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-13 03:14:33,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 03:14:33,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-13 03:14:33,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:33,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 03:14:33,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-13 03:14:33,093 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-13 03:14:33,094 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:14:33,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 03:14:33,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 03:14:33,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-13 03:14:39,688 INFO L241 LiptonReduction]: Total number of compositions: 92 [2022-12-13 03:14:39,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:14:39,708 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;@5d7ad686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:14:39,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:14:39,713 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 03:14:39,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:14:39,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:39,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:39,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1718979223, now seen corresponding path program 1 times [2022-12-13 03:14:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:39,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636764565] [2022-12-13 03:14:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:39,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-13 03:14:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:39,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636764565] [2022-12-13 03:14:39,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636764565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:39,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:39,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:14:39,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614662517] [2022-12-13 03:14:39,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:39,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 03:14:39,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 03:14:39,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 03:14:39,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 03:14:39,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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-13 03:14:39,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:39,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 03:14:39,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:40,186 INFO L130 PetriNetUnfolder]: 711/1177 cut-off events. [2022-12-13 03:14:40,186 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 03:14:40,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1177 events. 711/1177 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6273 event pairs, 711 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 2285. Up to 1073 conditions per place. [2022-12-13 03:14:40,197 INFO L137 encePairwiseOnDemand]: 28/29 looper letters, 19 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2022-12-13 03:14:40,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 103 flow [2022-12-13 03:14:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 03:14:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 03:14:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-12-13 03:14:40,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 03:14:40,207 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-13 03:14:40,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 28 transitions, 103 flow [2022-12-13 03:14:40,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 28 transitions, 103 flow [2022-12-13 03:14:40,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:40,217 INFO L89 Accepts]: Start accepts. Operand has 39 places, 28 transitions, 103 flow [2022-12-13 03:14:40,219 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:40,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:40,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 103 flow [2022-12-13 03:14:40,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 103 flow [2022-12-13 03:14:40,229 INFO L226 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-13 03:14:40,259 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:40,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 03:14:40,262 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 103 flow [2022-12-13 03:14:40,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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-13 03:14:40,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:40,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:40,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:14:40,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1623359709, now seen corresponding path program 1 times [2022-12-13 03:14:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:40,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441247610] [2022-12-13 03:14:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:40,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441247610] [2022-12-13 03:14:40,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441247610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:40,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:40,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:14:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658612896] [2022-12-13 03:14:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:40,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:14:40,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:40,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:14:40,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:14:40,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2022-12-13 03:14:40,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:40,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:40,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2022-12-13 03:14:40,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:40,674 INFO L130 PetriNetUnfolder]: 671/1143 cut-off events. [2022-12-13 03:14:40,674 INFO L131 PetriNetUnfolder]: For 58/68 co-relation queries the response was YES. [2022-12-13 03:14:40,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 1143 events. 671/1143 cut-off events. For 58/68 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6277 event pairs, 159 based on Foata normal form. 16/920 useless extension candidates. Maximal degree in co-relation 3209. Up to 1017 conditions per place. [2022-12-13 03:14:40,680 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 25 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-13 03:14:40,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 189 flow [2022-12-13 03:14:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:14:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:14:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 03:14:40,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-13 03:14:40,682 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 03:14:40,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 189 flow [2022-12-13 03:14:40,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 189 flow [2022-12-13 03:14:40,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:40,692 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 189 flow [2022-12-13 03:14:40,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:40,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:40,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 189 flow [2022-12-13 03:14:40,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 189 flow [2022-12-13 03:14:40,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-13 03:14:40,718 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:40,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 03:14:40,719 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 189 flow [2022-12-13 03:14:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:40,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:40,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:40,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:14:40,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1215455967, now seen corresponding path program 1 times [2022-12-13 03:14:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:40,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245381309] [2022-12-13 03:14:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:40,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245381309] [2022-12-13 03:14:40,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245381309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:40,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:40,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:14:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035363199] [2022-12-13 03:14:40,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:14:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:14:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:14:40,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2022-12-13 03:14:40,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:40,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:40,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2022-12-13 03:14:40,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:41,101 INFO L130 PetriNetUnfolder]: 1042/1788 cut-off events. [2022-12-13 03:14:41,101 INFO L131 PetriNetUnfolder]: For 682/686 co-relation queries the response was YES. [2022-12-13 03:14:41,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 1788 events. 1042/1788 cut-off events. For 682/686 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10671 event pairs, 85 based on Foata normal form. 80/1492 useless extension candidates. Maximal degree in co-relation 6441. Up to 1516 conditions per place. [2022-12-13 03:14:41,109 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 31 selfloop transitions, 3 changer transitions 20/62 dead transitions. [2022-12-13 03:14:41,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 456 flow [2022-12-13 03:14:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:14:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:14:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 03:14:41,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2022-12-13 03:14:41,111 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-13 03:14:41,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 62 transitions, 456 flow [2022-12-13 03:14:41,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 42 transitions, 296 flow [2022-12-13 03:14:41,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:41,125 INFO L89 Accepts]: Start accepts. Operand has 44 places, 42 transitions, 296 flow [2022-12-13 03:14:41,125 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:41,126 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:41,126 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 42 transitions, 296 flow [2022-12-13 03:14:41,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 42 transitions, 296 flow [2022-12-13 03:14:41,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-13 03:14:41,133 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:41,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:14:41,134 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 296 flow [2022-12-13 03:14:41,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:41,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:41,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:41,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:14:41,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:41,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:41,135 INFO L85 PathProgramCache]: Analyzing trace with hash 120816544, now seen corresponding path program 1 times [2022-12-13 03:14:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:41,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497830592] [2022-12-13 03:14:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:41,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497830592] [2022-12-13 03:14:41,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497830592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:41,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:41,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:14:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622005154] [2022-12-13 03:14:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:41,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:14:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:41,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:14:41,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:14:41,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2022-12-13 03:14:41,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:41,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:41,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2022-12-13 03:14:41,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:41,433 INFO L130 PetriNetUnfolder]: 517/926 cut-off events. [2022-12-13 03:14:41,433 INFO L131 PetriNetUnfolder]: For 609/609 co-relation queries the response was YES. [2022-12-13 03:14:41,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 926 events. 517/926 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4736 event pairs, 31 based on Foata normal form. 12/738 useless extension candidates. Maximal degree in co-relation 4128. Up to 787 conditions per place. [2022-12-13 03:14:41,439 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 50 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2022-12-13 03:14:41,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 581 flow [2022-12-13 03:14:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:14:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:14:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 03:14:41,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 03:14:41,441 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-13 03:14:41,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 63 transitions, 581 flow [2022-12-13 03:14:41,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 63 transitions, 581 flow [2022-12-13 03:14:41,450 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:41,450 INFO L89 Accepts]: Start accepts. Operand has 46 places, 63 transitions, 581 flow [2022-12-13 03:14:41,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:41,451 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:41,451 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 63 transitions, 581 flow [2022-12-13 03:14:41,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 63 transitions, 581 flow [2022-12-13 03:14:41,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-13 03:14:41,489 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:14:41,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 03:14:41,490 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 63 transitions, 581 flow [2022-12-13 03:14:41,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:41,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:41,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:41,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:14:41,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash -548433356, now seen corresponding path program 1 times [2022-12-13 03:14:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:41,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266702829] [2022-12-13 03:14:41,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:43,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266702829] [2022-12-13 03:14:43,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266702829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:43,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:43,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:14:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691178241] [2022-12-13 03:14:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:43,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:14:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:14:43,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:14:43,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 03:14:43,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 63 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:43,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:43,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 03:14:43,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:43,675 INFO L130 PetriNetUnfolder]: 786/1334 cut-off events. [2022-12-13 03:14:43,675 INFO L131 PetriNetUnfolder]: For 1222/1230 co-relation queries the response was YES. [2022-12-13 03:14:43,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7123 conditions, 1334 events. 786/1334 cut-off events. For 1222/1230 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7177 event pairs, 27 based on Foata normal form. 9/1058 useless extension candidates. Maximal degree in co-relation 7100. Up to 1119 conditions per place. [2022-12-13 03:14:43,686 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 82 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2022-12-13 03:14:43,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 99 transitions, 1124 flow [2022-12-13 03:14:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:14:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:14:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 03:14:43,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.646551724137931 [2022-12-13 03:14:43,690 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-13 03:14:43,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 99 transitions, 1124 flow [2022-12-13 03:14:43,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 99 transitions, 1124 flow [2022-12-13 03:14:43,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:43,713 INFO L89 Accepts]: Start accepts. Operand has 49 places, 99 transitions, 1124 flow [2022-12-13 03:14:43,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:43,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:43,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 99 transitions, 1124 flow [2022-12-13 03:14:43,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 99 transitions, 1124 flow [2022-12-13 03:14:43,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 03:14:43,722 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:43,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:14:43,723 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 99 transitions, 1124 flow [2022-12-13 03:14:43,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:43,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:43,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:43,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:14:43,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1119034896, now seen corresponding path program 1 times [2022-12-13 03:14:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:43,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075994961] [2022-12-13 03:14:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:44,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:44,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075994961] [2022-12-13 03:14:44,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075994961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:44,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:44,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:14:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482511443] [2022-12-13 03:14:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:44,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:14:44,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:44,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:14:44,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:14:44,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 03:14:44,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 99 transitions, 1124 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:44,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:44,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 03:14:44,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:44,545 INFO L130 PetriNetUnfolder]: 765/1298 cut-off events. [2022-12-13 03:14:44,545 INFO L131 PetriNetUnfolder]: For 1313/1323 co-relation queries the response was YES. [2022-12-13 03:14:44,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8134 conditions, 1298 events. 765/1298 cut-off events. For 1313/1323 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6940 event pairs, 45 based on Foata normal form. 9/1028 useless extension candidates. Maximal degree in co-relation 8108. Up to 1098 conditions per place. [2022-12-13 03:14:44,555 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 84 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2022-12-13 03:14:44,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 99 transitions, 1298 flow [2022-12-13 03:14:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:14:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:14:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 03:14:44,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2022-12-13 03:14:44,556 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-13 03:14:44,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 99 transitions, 1298 flow [2022-12-13 03:14:44,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 99 transitions, 1298 flow [2022-12-13 03:14:44,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:44,590 INFO L89 Accepts]: Start accepts. Operand has 52 places, 99 transitions, 1298 flow [2022-12-13 03:14:44,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:44,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:44,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 99 transitions, 1298 flow [2022-12-13 03:14:44,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 99 transitions, 1298 flow [2022-12-13 03:14:44,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-13 03:14:45,282 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:14:45,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 694 [2022-12-13 03:14:45,283 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 99 transitions, 1298 flow [2022-12-13 03:14:45,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:45,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:45,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:45,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:14:45,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1175608270, now seen corresponding path program 1 times [2022-12-13 03:14:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:45,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747373229] [2022-12-13 03:14:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:45,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747373229] [2022-12-13 03:14:45,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747373229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:45,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:45,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:14:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914577794] [2022-12-13 03:14:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:45,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:14:45,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:14:45,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:14:45,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 03:14:45,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 99 transitions, 1298 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:45,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:45,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 03:14:45,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:45,785 INFO L130 PetriNetUnfolder]: 1572/2528 cut-off events. [2022-12-13 03:14:45,786 INFO L131 PetriNetUnfolder]: For 9298/9316 co-relation queries the response was YES. [2022-12-13 03:14:45,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16666 conditions, 2528 events. 1572/2528 cut-off events. For 9298/9316 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 14825 event pairs, 97 based on Foata normal form. 196/2258 useless extension candidates. Maximal degree in co-relation 16637. Up to 1898 conditions per place. [2022-12-13 03:14:45,798 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 132 selfloop transitions, 48 changer transitions 11/199 dead transitions. [2022-12-13 03:14:45,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 199 transitions, 3029 flow [2022-12-13 03:14:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:14:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:14:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 03:14:45,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2022-12-13 03:14:45,800 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-13 03:14:45,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 199 transitions, 3029 flow [2022-12-13 03:14:45,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 188 transitions, 2853 flow [2022-12-13 03:14:45,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:45,824 INFO L89 Accepts]: Start accepts. Operand has 55 places, 188 transitions, 2853 flow [2022-12-13 03:14:45,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:45,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:45,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 188 transitions, 2853 flow [2022-12-13 03:14:45,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 188 transitions, 2853 flow [2022-12-13 03:14:45,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-13 03:14:45,842 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:45,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 03:14:45,844 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 188 transitions, 2853 flow [2022-12-13 03:14:45,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:45,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:45,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:45,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:14:45,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1452101335, now seen corresponding path program 1 times [2022-12-13 03:14:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:45,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387040372] [2022-12-13 03:14:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:45,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387040372] [2022-12-13 03:14:45,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387040372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:45,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:45,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:14:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142391190] [2022-12-13 03:14:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:45,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:14:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:45,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:14:45,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:14:45,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 03:14:45,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 188 transitions, 2853 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:45,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:45,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 03:14:45,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:46,350 INFO L130 PetriNetUnfolder]: 1005/1786 cut-off events. [2022-12-13 03:14:46,351 INFO L131 PetriNetUnfolder]: For 7783/7833 co-relation queries the response was YES. [2022-12-13 03:14:46,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13554 conditions, 1786 events. 1005/1786 cut-off events. For 7783/7833 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 10987 event pairs, 26 based on Foata normal form. 194/1678 useless extension candidates. Maximal degree in co-relation 13522. Up to 1358 conditions per place. [2022-12-13 03:14:46,362 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 90 selfloop transitions, 73 changer transitions 62/233 dead transitions. [2022-12-13 03:14:46,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 233 transitions, 3921 flow [2022-12-13 03:14:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:14:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:14:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 03:14:46,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.68 [2022-12-13 03:14:46,365 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-13 03:14:46,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 233 transitions, 3921 flow [2022-12-13 03:14:46,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 171 transitions, 2877 flow [2022-12-13 03:14:46,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:46,390 INFO L89 Accepts]: Start accepts. Operand has 59 places, 171 transitions, 2877 flow [2022-12-13 03:14:46,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:46,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:46,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 171 transitions, 2877 flow [2022-12-13 03:14:46,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 171 transitions, 2877 flow [2022-12-13 03:14:46,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-13 03:14:46,403 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:46,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 03:14:46,404 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 171 transitions, 2877 flow [2022-12-13 03:14:46,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:46,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:46,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:46,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:14:46,405 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2064847358, now seen corresponding path program 1 times [2022-12-13 03:14:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:46,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942145786] [2022-12-13 03:14:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:46,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942145786] [2022-12-13 03:14:46,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942145786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:46,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:46,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:14:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133044636] [2022-12-13 03:14:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:46,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:14:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:14:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:14:46,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 03:14:46,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 171 transitions, 2877 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:46,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:46,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 03:14:46,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:46,833 INFO L130 PetriNetUnfolder]: 1306/2410 cut-off events. [2022-12-13 03:14:46,833 INFO L131 PetriNetUnfolder]: For 13414/13449 co-relation queries the response was YES. [2022-12-13 03:14:46,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19864 conditions, 2410 events. 1306/2410 cut-off events. For 13414/13449 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15163 event pairs, 4 based on Foata normal form. 134/2134 useless extension candidates. Maximal degree in co-relation 19829. Up to 1791 conditions per place. [2022-12-13 03:14:46,845 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 179 selfloop transitions, 6 changer transitions 73/277 dead transitions. [2022-12-13 03:14:46,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 277 transitions, 5324 flow [2022-12-13 03:14:46,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:14:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:14:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 03:14:46,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-13 03:14:46,847 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2022-12-13 03:14:46,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 277 transitions, 5324 flow [2022-12-13 03:14:46,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 204 transitions, 3855 flow [2022-12-13 03:14:46,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:46,869 INFO L89 Accepts]: Start accepts. Operand has 62 places, 204 transitions, 3855 flow [2022-12-13 03:14:46,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:46,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:46,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 204 transitions, 3855 flow [2022-12-13 03:14:46,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 204 transitions, 3855 flow [2022-12-13 03:14:46,876 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 03:14:46,877 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:14:46,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:14:46,878 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 204 transitions, 3855 flow [2022-12-13 03:14:46,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:14:46,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:46,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:46,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:14:46,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:46,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1714599003, now seen corresponding path program 1 times [2022-12-13 03:14:46,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:46,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258974121] [2022-12-13 03:14:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:46,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:14:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:14:47,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:14:47,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258974121] [2022-12-13 03:14:47,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258974121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:14:47,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:14:47,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:14:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150390300] [2022-12-13 03:14:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:14:47,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:14:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:14:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:14:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:14:47,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 03:14:47,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 204 transitions, 3855 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-13 03:14:47,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:14:47,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 03:14:47,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:14:47,222 INFO L130 PetriNetUnfolder]: 627/1297 cut-off events. [2022-12-13 03:14:47,222 INFO L131 PetriNetUnfolder]: For 9948/10027 co-relation queries the response was YES. [2022-12-13 03:14:47,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11499 conditions, 1297 events. 627/1297 cut-off events. For 9948/10027 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8027 event pairs, 4 based on Foata normal form. 166/1260 useless extension candidates. Maximal degree in co-relation 11461. Up to 909 conditions per place. [2022-12-13 03:14:47,228 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 46 selfloop transitions, 65 changer transitions 83/199 dead transitions. [2022-12-13 03:14:47,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 199 transitions, 4135 flow [2022-12-13 03:14:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:14:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:14:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-13 03:14:47,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-13 03:14:47,230 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2022-12-13 03:14:47,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 199 transitions, 4135 flow [2022-12-13 03:14:47,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 116 transitions, 2387 flow [2022-12-13 03:14:47,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:14:47,241 INFO L89 Accepts]: Start accepts. Operand has 63 places, 116 transitions, 2387 flow [2022-12-13 03:14:47,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:14:47,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:14:47,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 116 transitions, 2387 flow [2022-12-13 03:14:47,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 116 transitions, 2387 flow [2022-12-13 03:14:47,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-13 03:14:47,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] L783-->P0FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:47,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [610] L783-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:47,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] L783-->L788: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:47,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L820-->L823: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:47,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L820-->P2FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:47,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L820-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_15| 0) (= |v_P2Thread1of1ForFork0_#res.base_15| 0) (= v_~__unbuffered_cnt~0_203 (+ v_~__unbuffered_cnt~0_204 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_204} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_203, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:47,344 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L798-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:47,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] L798-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:47,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L798-->L803: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 03:14:53,746 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:14:53,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6506 [2022-12-13 03:14:53,747 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 114 transitions, 2403 flow [2022-12-13 03:14:53,747 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-13 03:14:53,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:14:53,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:53,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:14:53,747 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:14:53,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:14:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash -168032360, now seen corresponding path program 1 times [2022-12-13 03:14:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:14:53,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154981157] [2022-12-13 03:14:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:14:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:14:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:14:53,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:14:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:14:53,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:14:53,833 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:14:53,834 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:14:53,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:14:53,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:14:53,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:14:53,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:14:53,835 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:14:53,839 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:14:53,839 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:14:53,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:14:53 BasicIcfg [2022-12-13 03:14:53,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:14:53,917 INFO L158 Benchmark]: Toolchain (without parser) took 22412.02ms. Allocated memory was 209.7MB in the beginning and 663.7MB in the end (delta: 454.0MB). Free memory was 183.6MB in the beginning and 454.8MB in the end (delta: -271.2MB). Peak memory consumption was 183.5MB. Max. memory is 8.0GB. [2022-12-13 03:14:53,917 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 186.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:14:53,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.73ms. Allocated memory is still 209.7MB. Free memory was 183.3MB in the beginning and 156.8MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 03:14:53,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.87ms. Allocated memory is still 209.7MB. Free memory was 156.8MB in the beginning and 154.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:14:53,918 INFO L158 Benchmark]: Boogie Preprocessor took 34.73ms. Allocated memory is still 209.7MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:14:53,918 INFO L158 Benchmark]: RCFGBuilder took 759.75ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 138.9MB in the end (delta: 13.3MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-12-13 03:14:53,918 INFO L158 Benchmark]: TraceAbstraction took 21057.99ms. Allocated memory was 209.7MB in the beginning and 663.7MB in the end (delta: 454.0MB). Free memory was 137.9MB in the beginning and 454.8MB in the end (delta: -317.0MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. [2022-12-13 03:14:53,922 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 209.7MB. Free memory is still 186.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.73ms. Allocated memory is still 209.7MB. Free memory was 183.3MB in the beginning and 156.8MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.87ms. Allocated memory is still 209.7MB. Free memory was 156.8MB in the beginning and 154.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.73ms. Allocated memory is still 209.7MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 759.75ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 138.9MB in the end (delta: 13.3MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21057.99ms. Allocated memory was 209.7MB in the beginning and 663.7MB in the end (delta: 454.0MB). Free memory was 137.9MB in the beginning and 454.8MB in the end (delta: -317.0MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 119 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 29 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1354, independent: 1263, independent conditional: 1263, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1354, independent: 1263, independent conditional: 0, independent unconditional: 1263, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1354, independent: 1263, independent conditional: 0, independent unconditional: 1263, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1354, independent: 1263, independent conditional: 0, independent unconditional: 1263, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 877, independent: 840, independent conditional: 0, independent unconditional: 840, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 877, independent: 812, independent conditional: 0, independent unconditional: 812, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1354, independent: 423, independent conditional: 0, independent unconditional: 423, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 877, unknown conditional: 0, unknown unconditional: 877] , Statistics on independence cache: Total cache size (in pairs): 1303, Positive cache size: 1266, Positive conditional cache size: 0, Positive unconditional cache size: 1266, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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.0s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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.0s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 126, independent conditional: 62, independent unconditional: 64, dependent: 18, dependent conditional: 15, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 77, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 39, independent conditional: 27, independent unconditional: 12, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 62, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 332, independent conditional: 332, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 332, independent conditional: 189, independent unconditional: 143, dependent: 28, dependent conditional: 13, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 332, independent conditional: 0, independent unconditional: 332, 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: 369, independent: 332, independent conditional: 0, independent unconditional: 332, 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: 24, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 24, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 369, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 211, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 110, independent conditional: 110, 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: 129, independent: 110, independent conditional: 89, independent unconditional: 21, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, independent: 110, independent conditional: 41, independent unconditional: 69, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 110, independent conditional: 41, independent unconditional: 69, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] ], Cache Queries: [ total: 167, independent: 110, independent conditional: 41, independent unconditional: 69, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 52 PlacesBefore, 52 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 224, independent conditional: 224, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 224, independent conditional: 178, independent unconditional: 46, dependent: 42, dependent conditional: 38, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 380, independent: 224, independent conditional: 82, independent unconditional: 142, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 380, independent: 224, independent conditional: 82, independent unconditional: 142, dependent: 156, dependent conditional: 0, dependent unconditional: 156, 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: 380, independent: 224, independent conditional: 82, independent unconditional: 142, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 248, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 188 TransitionsBefore, 188 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 322, independent: 276, independent conditional: 276, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 322, independent: 276, independent conditional: 184, independent unconditional: 92, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 506, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 506, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 230, dependent conditional: 0, dependent unconditional: 230, 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: 506, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 414, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 171 TransitionsBefore, 171 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400, independent: 360, independent conditional: 360, 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: 400, independent: 360, independent conditional: 320, independent unconditional: 40, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 600, independent: 360, independent conditional: 120, independent unconditional: 240, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 600, independent: 360, independent conditional: 120, independent unconditional: 240, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 600, independent: 356, independent conditional: 116, independent unconditional: 240, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 95, Positive conditional cache size: 4, Positive unconditional cache size: 91, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 440, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 204 TransitionsBefore, 204 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 95, Positive conditional cache size: 4, Positive unconditional cache size: 91, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: 6.5s, 63 PlacesBefore, 61 PlacesAfterwards, 116 TransitionsBefore, 114 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 115, Positive conditional cache size: 4, Positive unconditional cache size: 111, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049; [L838] FCALL, FORK 0 pthread_create(&t2049, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2049, ((void *)0), P0, ((void *)0))=-3, t2049={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t2050; [L840] FCALL, FORK 0 pthread_create(&t2050, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2050, ((void *)0), P1, ((void *)0))=-2, t2049={7:0}, t2050={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t2051; [L842] FCALL, FORK 0 pthread_create(&t2051, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2051, ((void *)0), P2, ((void *)0))=-1, t2049={7:0}, t2050={8:0}, t2051={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=255, weak$$choice2=1, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=255, weak$$choice2=1, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 x = 1 [L797] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=255, weak$$choice2=1, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=255, weak$$choice2=1, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=255, weak$$choice2=1, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 3 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 3 !(!cond) [L846] RET 3 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 3 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 3 \read(z) [L848] EXPR 3 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 3 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 3 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 3 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L855] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 3 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 3 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L859] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 3 !expression [L19] 3 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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 7 procedures, 149 locations, 4 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: 20.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 578 IncrementalHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 2 mSDtfsCounter, 578 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3855occurred in iteration=9, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 03:14:53,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...