/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:25:02,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:25:02,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:25:02,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:25:02,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:25:02,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:25:02,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:25:02,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:25:02,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:25:02,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:25:02,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:25:02,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:25:02,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:25:02,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:25:02,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:25:02,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:25:02,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:25:02,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:25:02,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:25:02,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:25:02,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:25:02,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:25:02,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:25:02,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:25:02,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:25:02,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:25:02,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:25:02,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:25:02,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:25:02,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:25:02,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:25:02,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:25:02,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:25:02,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:25:02,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:25:02,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:25:02,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:25:02,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:25:02,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:25:02,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:25:02,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:25:02,815 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:25:02,847 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:25:02,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:25:02,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:25:02,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:25:02,849 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:25:02,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:25:02,849 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:25:02,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:25:02,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:25:02,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:25:02,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:25:02,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:25:02,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:25:02,851 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:25:02,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:25:02,851 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:25:02,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:25:02,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:25:02,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:25:02,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:25:02,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:25:02,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:25:02,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:25:02,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:25:02,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:25:02,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:25:02,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:25:02,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:25:02,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:25:03,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:25:03,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:25:03,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:25:03,139 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:25:03,140 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:25:03,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2022-12-06 04:25:04,120 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:25:04,383 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:25:04,383 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2022-12-06 04:25:04,402 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5fab6d9/81cea78bd3e74578ab7e4c5ad109a1bd/FLAG113b33a12 [2022-12-06 04:25:04,414 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5fab6d9/81cea78bd3e74578ab7e4c5ad109a1bd [2022-12-06 04:25:04,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:25:04,417 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:25:04,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:25:04,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:25:04,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:25:04,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6ba913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04, skipping insertion in model container [2022-12-06 04:25:04,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:25:04,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:25:04,615 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/safe003_power.opt.i[951,964] [2022-12-06 04:25:04,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:25:04,790 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:25:04,797 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/safe003_power.opt.i[951,964] [2022-12-06 04:25:04,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:04,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:04,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:25:04,855 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:25:04,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04 WrapperNode [2022-12-06 04:25:04,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:25:04,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:25:04,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:25:04,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:25:04,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,890 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-12-06 04:25:04,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:25:04,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:25:04,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:25:04,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:25:04,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:25:04,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:25:04,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:25:04,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:25:04,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (1/1) ... [2022-12-06 04:25:04,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:25:04,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:25:04,962 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-06 04:25:04,984 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-06 04:25:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:25:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:25:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:25:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:25:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:25:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:25:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:25:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:25:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:25:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:25:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:25:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:25:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:25:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:25:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:25:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:25:05,000 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:25:05,165 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:25:05,167 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:25:05,526 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:25:05,864 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:25:05,865 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:25:05,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:25:05 BoogieIcfgContainer [2022-12-06 04:25:05,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:25:05,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:25:05,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:25:05,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:25:05,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:25:04" (1/3) ... [2022-12-06 04:25:05,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332ee975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:25:05, skipping insertion in model container [2022-12-06 04:25:05,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:04" (2/3) ... [2022-12-06 04:25:05,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332ee975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:25:05, skipping insertion in model container [2022-12-06 04:25:05,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:25:05" (3/3) ... [2022-12-06 04:25:05,876 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2022-12-06 04:25:05,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:25:05,893 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:25:05,893 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:25:05,970 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:25:06,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 04:25:06,057 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 04:25:06,057 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:06,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:25:06,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 04:25:06,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-06 04:25:06,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:06,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 04:25:06,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-06 04:25:06,112 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 04:25:06,113 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:06,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:25:06,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 04:25:06,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 04:25:15,426 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 04:25:15,437 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:25:15,441 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;@6546dc6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:25:15,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:25:15,444 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 04:25:15,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:15,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:15,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:25:15,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash 25498314, now seen corresponding path program 1 times [2022-12-06 04:25:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:15,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238350712] [2022-12-06 04:25:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:15,735 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-06 04:25:15,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:15,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238350712] [2022-12-06 04:25:15,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238350712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:15,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:15,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:25:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059756361] [2022-12-06 04:25:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:15,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:25:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:25:15,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:25:15,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:25:15,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-06 04:25:15,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:15,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:25:15,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:16,097 INFO L130 PetriNetUnfolder]: 1130/1694 cut-off events. [2022-12-06 04:25:16,097 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 04:25:16,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1694 events. 1130/1694 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8475 event pairs, 386 based on Foata normal form. 0/1491 useless extension candidates. Maximal degree in co-relation 3426. Up to 1078 conditions per place. [2022-12-06 04:25:16,106 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 30 selfloop transitions, 2 changer transitions 8/42 dead transitions. [2022-12-06 04:25:16,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2022-12-06 04:25:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:25:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:25:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 04:25:16,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 04:25:16,116 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 51 transitions. [2022-12-06 04:25:16,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2022-12-06 04:25:16,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:25:16,119 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-06 04:25:16,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 04:25:16,122 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 04:25:16,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:16,123 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 52 flow [2022-12-06 04:25:16,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:16,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:16,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 52 flow [2022-12-06 04:25:16,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:16,130 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:25:16,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:16,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:25:16,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:16,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:25:16,235 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:16,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 04:25:16,237 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:16,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-06 04:25:16,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:16,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:16,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:25:16,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1695451318, now seen corresponding path program 1 times [2022-12-06 04:25:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:16,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477363304] [2022-12-06 04:25:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:16,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:16,413 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-06 04:25:16,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:16,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477363304] [2022-12-06 04:25:16,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477363304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:16,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:16,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:25:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296619142] [2022-12-06 04:25:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:16,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:25:16,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:25:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:25:16,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:16,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-06 04:25:16,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:16,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:16,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:16,658 INFO L130 PetriNetUnfolder]: 1136/1687 cut-off events. [2022-12-06 04:25:16,659 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 04:25:16,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3552 conditions, 1687 events. 1136/1687 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7384 event pairs, 330 based on Foata normal form. 10/1697 useless extension candidates. Maximal degree in co-relation 3542. Up to 1619 conditions per place. [2022-12-06 04:25:16,667 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 31 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 04:25:16,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 150 flow [2022-12-06 04:25:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:25:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:25:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:25:16,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:25:16,668 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:25:16,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 150 flow [2022-12-06 04:25:16,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:16,671 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 67 flow [2022-12-06 04:25:16,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2022-12-06 04:25:16,672 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2022-12-06 04:25:16,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:16,672 INFO L89 Accepts]: Start accepts. Operand has 31 places, 23 transitions, 67 flow [2022-12-06 04:25:16,672 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:16,672 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:16,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 67 flow [2022-12-06 04:25:16,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 67 flow [2022-12-06 04:25:16,677 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 04:25:16,677 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:16,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 3/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 44. Up to 10 conditions per place. [2022-12-06 04:25:16,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 67 flow [2022-12-06 04:25:16,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 04:25:16,725 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:16,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 04:25:16,727 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2022-12-06 04:25:16,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-06 04:25:16,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:16,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:16,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:25:16,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1019382458, now seen corresponding path program 1 times [2022-12-06 04:25:16,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:16,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490095343] [2022-12-06 04:25:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:16,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:16,842 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-06 04:25:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490095343] [2022-12-06 04:25:16,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490095343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:16,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:16,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:25:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740832246] [2022-12-06 04:25:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:16,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:25:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:25:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:25:16,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:25:16,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 04:25:16,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:16,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:25:16,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:17,052 INFO L130 PetriNetUnfolder]: 817/1305 cut-off events. [2022-12-06 04:25:17,052 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-06 04:25:17,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 1305 events. 817/1305 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6113 event pairs, 196 based on Foata normal form. 23/1310 useless extension candidates. Maximal degree in co-relation 2785. Up to 918 conditions per place. [2022-12-06 04:25:17,058 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 04:25:17,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 152 flow [2022-12-06 04:25:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:25:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:25:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:25:17,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:25:17,060 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:25:17,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 152 flow [2022-12-06 04:25:17,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:17,061 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2022-12-06 04:25:17,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 04:25:17,062 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2022-12-06 04:25:17,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:17,062 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 72 flow [2022-12-06 04:25:17,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:17,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:17,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2022-12-06 04:25:17,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2022-12-06 04:25:17,067 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 04:25:17,067 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:25:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2022-12-06 04:25:17,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2022-12-06 04:25:17,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 04:25:17,069 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:17,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:25:17,070 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2022-12-06 04:25:17,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 04:25:17,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:17,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:17,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:25:17,070 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1282758790, now seen corresponding path program 1 times [2022-12-06 04:25:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:17,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456331431] [2022-12-06 04:25:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:17,166 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-06 04:25:17,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:17,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456331431] [2022-12-06 04:25:17,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456331431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:17,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:17,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512875345] [2022-12-06 04:25:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:17,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:17,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:17,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:17,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:17,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:17,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:17,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:17,651 INFO L130 PetriNetUnfolder]: 2290/3454 cut-off events. [2022-12-06 04:25:17,651 INFO L131 PetriNetUnfolder]: For 935/935 co-relation queries the response was YES. [2022-12-06 04:25:17,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 3454 events. 2290/3454 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17542 event pairs, 488 based on Foata normal form. 128/3582 useless extension candidates. Maximal degree in co-relation 7738. Up to 1317 conditions per place. [2022-12-06 04:25:17,663 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 36 selfloop transitions, 4 changer transitions 23/63 dead transitions. [2022-12-06 04:25:17,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 63 transitions, 293 flow [2022-12-06 04:25:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 04:25:17,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2022-12-06 04:25:17,666 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 5 states and 64 transitions. [2022-12-06 04:25:17,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 63 transitions, 293 flow [2022-12-06 04:25:17,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 63 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:17,669 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 104 flow [2022-12-06 04:25:17,669 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-06 04:25:17,672 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-06 04:25:17,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:17,673 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 104 flow [2022-12-06 04:25:17,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:17,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:17,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 104 flow [2022-12-06 04:25:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 104 flow [2022-12-06 04:25:17,681 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-06 04:25:17,681 INFO L131 PetriNetUnfolder]: For 54/69 co-relation queries the response was YES. [2022-12-06 04:25:17,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 47 events. 3/47 cut-off events. For 54/69 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 156 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 95. Up to 14 conditions per place. [2022-12-06 04:25:17,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 104 flow [2022-12-06 04:25:17,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 04:25:17,689 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:17,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 04:25:17,694 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 104 flow [2022-12-06 04:25:17,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:17,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:17,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:17,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:25:17,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:17,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1571058912, now seen corresponding path program 2 times [2022-12-06 04:25:17,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:17,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593409773] [2022-12-06 04:25:17,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:17,777 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-06 04:25:17,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:17,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593409773] [2022-12-06 04:25:17,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593409773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:17,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:17,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:25:17,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555102022] [2022-12-06 04:25:17,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:17,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:25:17,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:17,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:25:17,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:25:17,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:25:17,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-06 04:25:17,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:17,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:25:17,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:18,047 INFO L130 PetriNetUnfolder]: 1287/1998 cut-off events. [2022-12-06 04:25:18,047 INFO L131 PetriNetUnfolder]: For 2204/2204 co-relation queries the response was YES. [2022-12-06 04:25:18,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4966 conditions, 1998 events. 1287/1998 cut-off events. For 2204/2204 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9234 event pairs, 453 based on Foata normal form. 35/2028 useless extension candidates. Maximal degree in co-relation 4951. Up to 1314 conditions per place. [2022-12-06 04:25:18,056 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 31 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-06 04:25:18,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 202 flow [2022-12-06 04:25:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:25:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:25:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:25:18,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 04:25:18,057 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 104 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:25:18,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 202 flow [2022-12-06 04:25:18,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 180 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 04:25:18,061 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 96 flow [2022-12-06 04:25:18,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-12-06 04:25:18,062 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2022-12-06 04:25:18,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:18,062 INFO L89 Accepts]: Start accepts. Operand has 36 places, 25 transitions, 96 flow [2022-12-06 04:25:18,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:18,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:18,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 25 transitions, 96 flow [2022-12-06 04:25:18,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 96 flow [2022-12-06 04:25:18,068 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-06 04:25:18,068 INFO L131 PetriNetUnfolder]: For 26/35 co-relation queries the response was YES. [2022-12-06 04:25:18,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 47 events. 3/47 cut-off events. For 26/35 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 160 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 82. Up to 9 conditions per place. [2022-12-06 04:25:18,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 96 flow [2022-12-06 04:25:18,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 04:25:18,070 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:18,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:25:18,071 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 96 flow [2022-12-06 04:25:18,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-06 04:25:18,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:18,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:18,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:25:18,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1461763622, now seen corresponding path program 1 times [2022-12-06 04:25:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:18,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867240575] [2022-12-06 04:25:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:18,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:18,152 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-06 04:25:18,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:18,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867240575] [2022-12-06 04:25:18,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867240575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:18,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:18,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:25:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244083656] [2022-12-06 04:25:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:18,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:18,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:18,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:18,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:18,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 96 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:18,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:18,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:18,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:18,492 INFO L130 PetriNetUnfolder]: 1912/2921 cut-off events. [2022-12-06 04:25:18,492 INFO L131 PetriNetUnfolder]: For 1880/1880 co-relation queries the response was YES. [2022-12-06 04:25:18,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7051 conditions, 2921 events. 1912/2921 cut-off events. For 1880/1880 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14887 event pairs, 459 based on Foata normal form. 105/3026 useless extension candidates. Maximal degree in co-relation 7036. Up to 1703 conditions per place. [2022-12-06 04:25:18,502 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 35 selfloop transitions, 4 changer transitions 8/47 dead transitions. [2022-12-06 04:25:18,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 251 flow [2022-12-06 04:25:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 04:25:18,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:25:18,505 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 96 flow. Second operand 4 states and 46 transitions. [2022-12-06 04:25:18,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 251 flow [2022-12-06 04:25:18,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 236 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:25:18,511 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 101 flow [2022-12-06 04:25:18,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-06 04:25:18,512 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2022-12-06 04:25:18,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:18,512 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 101 flow [2022-12-06 04:25:18,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:18,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:18,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 101 flow [2022-12-06 04:25:18,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 101 flow [2022-12-06 04:25:18,521 INFO L130 PetriNetUnfolder]: 2/39 cut-off events. [2022-12-06 04:25:18,521 INFO L131 PetriNetUnfolder]: For 32/34 co-relation queries the response was YES. [2022-12-06 04:25:18,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 39 events. 2/39 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 105 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 71. Up to 7 conditions per place. [2022-12-06 04:25:18,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 101 flow [2022-12-06 04:25:18,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 04:25:18,538 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:18,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 04:25:18,538 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 101 flow [2022-12-06 04:25:18,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:18,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:18,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:18,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:25:18,539 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash 423925615, now seen corresponding path program 1 times [2022-12-06 04:25:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:18,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616293332] [2022-12-06 04:25:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:18,749 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-06 04:25:18,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:18,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616293332] [2022-12-06 04:25:18,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616293332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:18,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:18,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973709517] [2022-12-06 04:25:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:18,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:18,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:18,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 101 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-06 04:25:18,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:18,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:18,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:19,057 INFO L130 PetriNetUnfolder]: 1226/1899 cut-off events. [2022-12-06 04:25:19,058 INFO L131 PetriNetUnfolder]: For 1173/1173 co-relation queries the response was YES. [2022-12-06 04:25:19,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4574 conditions, 1899 events. 1226/1899 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8850 event pairs, 331 based on Foata normal form. 36/1935 useless extension candidates. Maximal degree in co-relation 4559. Up to 841 conditions per place. [2022-12-06 04:25:19,066 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 35 selfloop transitions, 4 changer transitions 10/49 dead transitions. [2022-12-06 04:25:19,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 252 flow [2022-12-06 04:25:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 04:25:19,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:25:19,068 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 101 flow. Second operand 4 states and 49 transitions. [2022-12-06 04:25:19,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 252 flow [2022-12-06 04:25:19,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 240 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:25:19,071 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 105 flow [2022-12-06 04:25:19,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-06 04:25:19,072 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-06 04:25:19,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:19,072 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 105 flow [2022-12-06 04:25:19,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:19,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:19,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 105 flow [2022-12-06 04:25:19,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 105 flow [2022-12-06 04:25:19,079 INFO L130 PetriNetUnfolder]: 2/43 cut-off events. [2022-12-06 04:25:19,080 INFO L131 PetriNetUnfolder]: For 42/43 co-relation queries the response was YES. [2022-12-06 04:25:19,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 43 events. 2/43 cut-off events. For 42/43 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 82. Up to 8 conditions per place. [2022-12-06 04:25:19,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 105 flow [2022-12-06 04:25:19,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 04:25:19,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:25:19,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 04:25:19,105 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 103 flow [2022-12-06 04:25:19,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-06 04:25:19,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:19,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:19,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:25:19,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1293318639, now seen corresponding path program 1 times [2022-12-06 04:25:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:19,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568944510] [2022-12-06 04:25:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:19,884 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-06 04:25:19,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:19,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568944510] [2022-12-06 04:25:19,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568944510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:19,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:19,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:25:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439944858] [2022-12-06 04:25:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:19,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:25:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:19,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:25:19,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:25:19,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:25:19,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:19,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:19,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:25:19,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:20,121 INFO L130 PetriNetUnfolder]: 843/1333 cut-off events. [2022-12-06 04:25:20,121 INFO L131 PetriNetUnfolder]: For 1549/1549 co-relation queries the response was YES. [2022-12-06 04:25:20,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3398 conditions, 1333 events. 843/1333 cut-off events. For 1549/1549 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5820 event pairs, 296 based on Foata normal form. 5/1338 useless extension candidates. Maximal degree in co-relation 3383. Up to 1210 conditions per place. [2022-12-06 04:25:20,127 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 39 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2022-12-06 04:25:20,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 286 flow [2022-12-06 04:25:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 04:25:20,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 04:25:20,128 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 103 flow. Second operand 5 states and 52 transitions. [2022-12-06 04:25:20,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 286 flow [2022-12-06 04:25:20,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 260 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 04:25:20,130 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 150 flow [2022-12-06 04:25:20,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-06 04:25:20,131 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 04:25:20,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:20,131 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 150 flow [2022-12-06 04:25:20,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:20,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:20,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 150 flow [2022-12-06 04:25:20,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 150 flow [2022-12-06 04:25:20,151 INFO L130 PetriNetUnfolder]: 25/109 cut-off events. [2022-12-06 04:25:20,151 INFO L131 PetriNetUnfolder]: For 94/98 co-relation queries the response was YES. [2022-12-06 04:25:20,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 109 events. 25/109 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 508 event pairs, 4 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 253. Up to 40 conditions per place. [2022-12-06 04:25:20,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 150 flow [2022-12-06 04:25:20,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 04:25:20,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [668] L809-->L816: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd2~0_100 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd2~0_94 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse6 (not .cse8)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (let ((.cse0 (and .cse6 .cse11)) (.cse1 (select |v_#memory_int_166| |v_~#x~0.base_116|)) (.cse2 (not .cse9)) (.cse3 (not .cse10)) (.cse5 (not .cse7))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_100) v_~x$r_buff0_thd2~0_99) (= (store |v_#memory_int_166| |v_~#x~0.base_116| (store .cse1 |v_~#x~0.offset_116| |v_P1_#t~ite24_25|)) |v_#memory_int_165|) (= (ite (or .cse0 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_180) v_~x$w_buff1_used~0_179) (let ((.cse4 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_36|))) (or (and .cse4 (= |v_P1_#t~ite23_31| |v_P1Thread1of1ForFork0_#t~ite23_1|) (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_82) .cse5 .cse6) (and (= |v_P1_#t~ite23_31| |v_P1_#t~ite24_25|) (or .cse7 .cse8) (or (and (= |v_P1_#t~ite23_31| |v_P1_#t~mem22_36|) (or .cse9 .cse10) (= |v_P1_#t~mem22_36| (select .cse1 |v_~#x~0.offset_116|))) (and .cse2 .cse4 .cse3 (= |v_P1_#t~ite23_31| v_~x$w_buff1~0_69)))))) (= v_~x$r_buff1_thd2~0_93 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_179 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_99 256) 0)) .cse11)) 0 v_~x$r_buff1_thd2~0_94)) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_203) v_~x$w_buff0_used~0_202))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_82, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, #memory_int=|v_#memory_int_166|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_82, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_165|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_179, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~ite23_31|, |v_P1_#t~mem22_36|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-06 04:25:20,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [675] L829-->L836: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_43 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse3 (= (mod v_~x$r_buff1_thd3~0_37 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse11 (not (= 0 (mod v_~x$w_buff0_used~0_210 256)))) (.cse9 (not .cse8))) (let ((.cse0 (and .cse11 .cse9)) (.cse4 (not .cse2)) (.cse1 (select |v_#memory_int_178| |v_~#x~0.base_122|)) (.cse6 (not .cse3)) (.cse10 (not .cse7))) (and (= v_~x$r_buff0_thd3~0_42 (ite .cse0 0 v_~x$r_buff0_thd3~0_43)) (let ((.cse5 (= |v_P2_#t~mem25_32| |v_P2Thread1of1ForFork1_#t~mem25_1|))) (or (and (or (and (= (select .cse1 |v_~#x~0.offset_122|) |v_P2_#t~mem25_32|) (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse2 .cse3)) (and .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_75) .cse5 .cse6)) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_23|) (or .cse7 .cse8)) (and .cse9 .cse5 .cse10 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork1_#t~ite26_1|) (= |v_P2_#t~ite27_23| v_~x$w_buff0~0_84)))) (= (ite (or .cse0 (and .cse4 .cse6)) 0 v_~x$w_buff1_used~0_188) v_~x$w_buff1_used~0_187) (= |v_#memory_int_177| (store |v_#memory_int_178| |v_~#x~0.base_122| (store .cse1 |v_~#x~0.offset_122| |v_P2_#t~ite27_23|))) (= v_~x$r_buff1_thd3~0_36 (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_187 256))) .cse6) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_42 256) 0)))) 0 v_~x$r_buff1_thd3~0_37)) (= v_~x$w_buff0_used~0_210 (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_211)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_122|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_1|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_178|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_122|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_177|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_23|] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P2Thread1of1ForFork1_#t~mem25, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:25:21,284 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:25:21,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1155 [2022-12-06 04:25:21,286 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 154 flow [2022-12-06 04:25:21,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:21,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:21,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:21,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:25:21,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1125466743, now seen corresponding path program 1 times [2022-12-06 04:25:21,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:21,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411978451] [2022-12-06 04:25:21,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:22,212 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-06 04:25:22,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:22,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411978451] [2022-12-06 04:25:22,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411978451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:22,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:22,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:25:22,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108468488] [2022-12-06 04:25:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:22,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:25:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:25:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:25:22,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:25:22,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 154 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-06 04:25:22,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:22,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:25:22,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:22,566 INFO L130 PetriNetUnfolder]: 908/1424 cut-off events. [2022-12-06 04:25:22,567 INFO L131 PetriNetUnfolder]: For 1739/1739 co-relation queries the response was YES. [2022-12-06 04:25:22,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4091 conditions, 1424 events. 908/1424 cut-off events. For 1739/1739 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6499 event pairs, 239 based on Foata normal form. 40/1464 useless extension candidates. Maximal degree in co-relation 4074. Up to 942 conditions per place. [2022-12-06 04:25:22,578 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 42 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2022-12-06 04:25:22,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 341 flow [2022-12-06 04:25:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 04:25:22,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2022-12-06 04:25:22,580 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 154 flow. Second operand 5 states and 57 transitions. [2022-12-06 04:25:22,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 341 flow [2022-12-06 04:25:22,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 335 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 04:25:22,582 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 213 flow [2022-12-06 04:25:22,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-06 04:25:22,583 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2022-12-06 04:25:22,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:22,583 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 213 flow [2022-12-06 04:25:22,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:22,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:22,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 213 flow [2022-12-06 04:25:22,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 213 flow [2022-12-06 04:25:22,612 INFO L130 PetriNetUnfolder]: 117/249 cut-off events. [2022-12-06 04:25:22,613 INFO L131 PetriNetUnfolder]: For 455/505 co-relation queries the response was YES. [2022-12-06 04:25:22,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 249 events. 117/249 cut-off events. For 455/505 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1171 event pairs, 25 based on Foata normal form. 1/213 useless extension candidates. Maximal degree in co-relation 798. Up to 162 conditions per place. [2022-12-06 04:25:22,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 213 flow [2022-12-06 04:25:22,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 04:25:22,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [668] L809-->L816: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd2~0_100 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd2~0_94 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse6 (not .cse8)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (let ((.cse0 (and .cse6 .cse11)) (.cse1 (select |v_#memory_int_166| |v_~#x~0.base_116|)) (.cse2 (not .cse9)) (.cse3 (not .cse10)) (.cse5 (not .cse7))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_100) v_~x$r_buff0_thd2~0_99) (= (store |v_#memory_int_166| |v_~#x~0.base_116| (store .cse1 |v_~#x~0.offset_116| |v_P1_#t~ite24_25|)) |v_#memory_int_165|) (= (ite (or .cse0 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_180) v_~x$w_buff1_used~0_179) (let ((.cse4 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_36|))) (or (and .cse4 (= |v_P1_#t~ite23_31| |v_P1Thread1of1ForFork0_#t~ite23_1|) (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_82) .cse5 .cse6) (and (= |v_P1_#t~ite23_31| |v_P1_#t~ite24_25|) (or .cse7 .cse8) (or (and (= |v_P1_#t~ite23_31| |v_P1_#t~mem22_36|) (or .cse9 .cse10) (= |v_P1_#t~mem22_36| (select .cse1 |v_~#x~0.offset_116|))) (and .cse2 .cse4 .cse3 (= |v_P1_#t~ite23_31| v_~x$w_buff1~0_69)))))) (= v_~x$r_buff1_thd2~0_93 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_179 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_99 256) 0)) .cse11)) 0 v_~x$r_buff1_thd2~0_94)) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_203) v_~x$w_buff0_used~0_202))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_82, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, #memory_int=|v_#memory_int_166|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_82, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_165|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_179, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~ite23_31|, |v_P1_#t~mem22_36|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-06 04:25:23,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [757] L2-1-->L869: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd0~0_51 256) 0))) (let ((.cse0 (= (mod v_~x$w_buff0_used~0_315 256) 0)) (.cse9 (not .cse1)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_314 256) 0))) (.cse6 (= (mod v_~x$r_buff1_thd0~0_61 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_280 256) 0))) (let ((.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (select |v_#memory_int_288| |v_~#x~0.base_176|)) (.cse11 (and .cse9 .cse10)) (.cse8 (not .cse0))) (and (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem34#1_46| |v_ULTIMATE.start_main_#t~mem34#1_44|))) (or (and (or .cse0 .cse1) (= |v_ULTIMATE.start_main_#t~ite35#1_43| |v_ULTIMATE.start_main_#t~ite36#1_40|) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_43| v_~x$w_buff1~0_151) .cse2 .cse3 .cse4) (and (= |v_ULTIMATE.start_main_#t~mem34#1_44| (select .cse5 |v_~#x~0.offset_176|)) (= |v_ULTIMATE.start_main_#t~ite35#1_43| |v_ULTIMATE.start_main_#t~mem34#1_44|) (or .cse6 .cse7)))) (and .cse8 (= |v_ULTIMATE.start_main_#t~ite36#1_40| v_~x$w_buff0~0_170) .cse2 .cse9 (= |v_ULTIMATE.start_main_#t~ite35#1_45| |v_ULTIMATE.start_main_#t~ite35#1_43|)))) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0)) .cse10) (and (not (= (mod v_~x$w_buff1_used~0_279 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_61) v_~x$r_buff1_thd0~0_60) (= v_~x$w_buff1_used~0_279 (ite (or (and .cse3 .cse4) .cse11) 0 v_~x$w_buff1_used~0_280)) (= (store |v_#memory_int_288| |v_~#x~0.base_176| (store .cse5 |v_~#x~0.offset_176| |v_ULTIMATE.start_main_#t~ite36#1_40|)) |v_#memory_int_287|) (= (ite .cse11 0 v_~x$r_buff0_thd0~0_51) v_~x$r_buff0_thd0~0_50) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_315) v_~x$w_buff0_used~0_314))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_170, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_45|, ~#x~0.offset=|v_~#x~0.offset_176|, ~x$w_buff1~0=v_~x$w_buff1~0_151, #memory_int=|v_#memory_int_288|, ~#x~0.base=|v_~#x~0.base_176|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_280, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_46|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_315} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_170, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_39|, ~#x~0.offset=|v_~#x~0.offset_176|, ~x$w_buff1~0=v_~x$w_buff1~0_151, #memory_int=|v_#memory_int_287|, ~#x~0.base=|v_~#x~0.base_176|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_279, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_314} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_43|, |v_ULTIMATE.start_main_#t~ite36#1_40|, |v_ULTIMATE.start_main_#t~mem34#1_44|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~ite36#1, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 04:25:23,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [787] L856-3-->L858-2: Formula: (and (= (store |v_#length_57| |v_ULTIMATE.start_main_~#t1854~0#1.base_54| 4) |v_#length_56|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre32#1_19|) (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#t1854~0#1.base_54|) (not (= |v_ULTIMATE.start_main_~#t1854~0#1.base_54| 0)) (= (select |v_#valid_124| |v_ULTIMATE.start_main_~#t1854~0#1.base_54|) 0) (= (store |v_#memory_int_340| |v_ULTIMATE.start_main_~#t1854~0#1.base_54| (store (select |v_#memory_int_340| |v_ULTIMATE.start_main_~#t1854~0#1.base_54|) |v_ULTIMATE.start_main_~#t1854~0#1.offset_38| |v_ULTIMATE.start_main_#t~pre32#1_19|)) |v_#memory_int_339|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1)) (= |v_ULTIMATE.start_main_~#t1854~0#1.offset_38| 0) (= |v_#valid_123| (store |v_#valid_124| |v_ULTIMATE.start_main_~#t1854~0#1.base_54| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_25|, #pthreadsForks=|v_#pthreadsForks_39|, #valid=|v_#valid_124|, #memory_int=|v_#memory_int_340|, #length=|v_#length_57|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_25|, ULTIMATE.start_main_~#t1854~0#1.offset=|v_ULTIMATE.start_main_~#t1854~0#1.offset_38|, #pthreadsForks=|v_#pthreadsForks_38|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_339|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_15|, #length=|v_#length_56|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_19|, ULTIMATE.start_main_~#t1854~0#1.base=|v_ULTIMATE.start_main_~#t1854~0#1.base_54|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1854~0#1.offset, #pthreadsForks, #valid, #memory_int, ULTIMATE.start_main_#t~nondet31#1, #length, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_~#t1854~0#1.base, ULTIMATE.start_main_#t~pre30#1] [2022-12-06 04:25:23,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [675] L829-->L836: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_43 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse3 (= (mod v_~x$r_buff1_thd3~0_37 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse11 (not (= 0 (mod v_~x$w_buff0_used~0_210 256)))) (.cse9 (not .cse8))) (let ((.cse0 (and .cse11 .cse9)) (.cse4 (not .cse2)) (.cse1 (select |v_#memory_int_178| |v_~#x~0.base_122|)) (.cse6 (not .cse3)) (.cse10 (not .cse7))) (and (= v_~x$r_buff0_thd3~0_42 (ite .cse0 0 v_~x$r_buff0_thd3~0_43)) (let ((.cse5 (= |v_P2_#t~mem25_32| |v_P2Thread1of1ForFork1_#t~mem25_1|))) (or (and (or (and (= (select .cse1 |v_~#x~0.offset_122|) |v_P2_#t~mem25_32|) (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse2 .cse3)) (and .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_75) .cse5 .cse6)) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_23|) (or .cse7 .cse8)) (and .cse9 .cse5 .cse10 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork1_#t~ite26_1|) (= |v_P2_#t~ite27_23| v_~x$w_buff0~0_84)))) (= (ite (or .cse0 (and .cse4 .cse6)) 0 v_~x$w_buff1_used~0_188) v_~x$w_buff1_used~0_187) (= |v_#memory_int_177| (store |v_#memory_int_178| |v_~#x~0.base_122| (store .cse1 |v_~#x~0.offset_122| |v_P2_#t~ite27_23|))) (= v_~x$r_buff1_thd3~0_36 (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_187 256))) .cse6) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_42 256) 0)))) 0 v_~x$r_buff1_thd3~0_37)) (= v_~x$w_buff0_used~0_210 (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_211)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_122|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_1|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_178|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_122|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_177|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_23|] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P2Thread1of1ForFork1_#t~mem25, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:25:24,271 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:25:24,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1689 [2022-12-06 04:25:24,272 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 229 flow [2022-12-06 04:25:24,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-06 04:25:24,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:24,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:24,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:25:24,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1125462434, now seen corresponding path program 1 times [2022-12-06 04:25:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:24,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131475794] [2022-12-06 04:25:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:24,456 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-06 04:25:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:24,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131475794] [2022-12-06 04:25:24,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131475794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:24,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:24,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:25:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515953830] [2022-12-06 04:25:24,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:24,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:25:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:24,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:25:24,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:25:24,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 04:25:24,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 04:25:24,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:24,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 04:25:24,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:24,622 INFO L130 PetriNetUnfolder]: 525/869 cut-off events. [2022-12-06 04:25:24,623 INFO L131 PetriNetUnfolder]: For 1993/1995 co-relation queries the response was YES. [2022-12-06 04:25:24,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 869 events. 525/869 cut-off events. For 1993/1995 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3654 event pairs, 104 based on Foata normal form. 44/909 useless extension candidates. Maximal degree in co-relation 3257. Up to 675 conditions per place. [2022-12-06 04:25:24,627 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 45 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-12-06 04:25:24,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 425 flow [2022-12-06 04:25:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:25:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:25:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 04:25:24,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:25:24,628 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 229 flow. Second operand 3 states and 48 transitions. [2022-12-06 04:25:24,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 425 flow [2022-12-06 04:25:24,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 386 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 04:25:24,631 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 224 flow [2022-12-06 04:25:24,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 04:25:24,632 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2022-12-06 04:25:24,633 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:24,633 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 224 flow [2022-12-06 04:25:24,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:24,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:24,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 224 flow [2022-12-06 04:25:24,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 224 flow [2022-12-06 04:25:24,670 INFO L130 PetriNetUnfolder]: 179/382 cut-off events. [2022-12-06 04:25:24,670 INFO L131 PetriNetUnfolder]: For 409/431 co-relation queries the response was YES. [2022-12-06 04:25:24,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 382 events. 179/382 cut-off events. For 409/431 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2041 event pairs, 35 based on Foata normal form. 3/353 useless extension candidates. Maximal degree in co-relation 1067. Up to 197 conditions per place. [2022-12-06 04:25:24,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 224 flow [2022-12-06 04:25:24,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:25:24,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:24,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 04:25:24,675 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 224 flow [2022-12-06 04:25:24,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 04:25:24,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:24,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:24,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:25:24,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2004874434, now seen corresponding path program 1 times [2022-12-06 04:25:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:24,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556753257] [2022-12-06 04:25:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:24,848 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-06 04:25:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:24,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556753257] [2022-12-06 04:25:24,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556753257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:24,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:24,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458109286] [2022-12-06 04:25:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:24,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:24,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 04:25:24,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:24,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:24,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 04:25:24,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:24,972 INFO L130 PetriNetUnfolder]: 291/527 cut-off events. [2022-12-06 04:25:24,972 INFO L131 PetriNetUnfolder]: For 799/801 co-relation queries the response was YES. [2022-12-06 04:25:24,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2019 conditions, 527 events. 291/527 cut-off events. For 799/801 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2123 event pairs, 57 based on Foata normal form. 48/571 useless extension candidates. Maximal degree in co-relation 1999. Up to 224 conditions per place. [2022-12-06 04:25:24,975 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 53 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-06 04:25:24,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 484 flow [2022-12-06 04:25:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 04:25:24,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 04:25:24,976 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 224 flow. Second operand 4 states and 60 transitions. [2022-12-06 04:25:24,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 484 flow [2022-12-06 04:25:24,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:24,979 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 260 flow [2022-12-06 04:25:24,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-06 04:25:24,980 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2022-12-06 04:25:24,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:24,980 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 260 flow [2022-12-06 04:25:24,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:24,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:24,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 260 flow [2022-12-06 04:25:24,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 260 flow [2022-12-06 04:25:25,002 INFO L130 PetriNetUnfolder]: 85/218 cut-off events. [2022-12-06 04:25:25,003 INFO L131 PetriNetUnfolder]: For 289/309 co-relation queries the response was YES. [2022-12-06 04:25:25,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 218 events. 85/218 cut-off events. For 289/309 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 994 event pairs, 6 based on Foata normal form. 13/218 useless extension candidates. Maximal degree in co-relation 697. Up to 103 conditions per place. [2022-12-06 04:25:25,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 260 flow [2022-12-06 04:25:25,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 04:25:25,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L858-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_46 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_46 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} OutVars{ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_11|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [810] L761-->L869: Formula: (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_212 256) 0))) (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_613 256) 0))) (.cse2 (not .cse3))) (let ((.cse1 (select |v_#memory_int_603| |v_~#x~0.base_300|)) (.cse5 (and .cse4 .cse2)) (.cse0 (= (mod v_~x$w_buff0_used~0_615 256) 0))) (and (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_82| (ite .cse0 1 0)) (= (store |v_#memory_int_603| |v_~#x~0.base_300| (store .cse1 |v_~#x~0.offset_300| |v_ULTIMATE.start_main_#t~ite36#1_156|)) |v_#memory_int_602|) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_209| |v_ULTIMATE.start_main_#t~mem34#1_211|) (= v_~x$w_buff0~0_368 |v_ULTIMATE.start_main_#t~ite36#1_156|) .cse2 (= |v_ULTIMATE.start_main_#t~ite35#1_209| |v_ULTIMATE.start_main_#t~ite35#1_207|)) (and (= |v_ULTIMATE.start_main_#t~ite35#1_207| |v_ULTIMATE.start_main_#t~ite36#1_156|) (= |v_ULTIMATE.start_main_#t~mem34#1_209| |v_ULTIMATE.start_main_#t~ite35#1_207|) (= |v_ULTIMATE.start_main_#t~mem34#1_209| (select .cse1 |v_~#x~0.offset_300|)) .cse3)) (= v_~x$r_buff0_thd2~0_284 v_~x$r_buff1_thd2~0_292) (= v_~x$w_buff0_used~0_613 (ite .cse2 0 1)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_82| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_82|) (= v_~x$r_buff0_thd1~0_236 v_~x$r_buff1_thd1~0_165) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_82| 0)) (= v_~x$r_buff1_thd0~0_230 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_211 256) 0)) .cse4) (and (not (= (mod v_~x$w_buff1_used~0_520 256) 0)) .cse2)) 0 v_~x$r_buff0_thd0~0_212)) (= v_~x$r_buff0_thd1~0_235 1) (= v_~x$r_buff0_thd3~0_191 v_~x$r_buff1_thd3~0_191) (= v_~x$w_buff0~0_369 v_~x$w_buff1~0_304) (= v_~x$w_buff0~0_368 1) (= v_~x$r_buff0_thd0~0_211 (ite .cse5 0 v_~x$r_buff0_thd0~0_212)) (= (ite (or .cse5 (and (not .cse0) .cse2)) 0 v_~x$w_buff0_used~0_615) v_~x$w_buff1_used~0_520))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_369, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_212, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_209|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_236, ~#x~0.offset=|v_~#x~0.offset_300|, #memory_int=|v_#memory_int_603|, ~#x~0.base=|v_~#x~0.base_300|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_211|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_191, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_284, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_615} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_368, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_211, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_155|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_235, ~#x~0.offset=|v_~#x~0.offset_300|, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_520, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_191, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_292, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_191, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_230, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_284, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_613, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_82|, #memory_int=|v_#memory_int_602|, ~#x~0.base=|v_~#x~0.base_300|} AuxVars[|v_ULTIMATE.start_main_#t~mem34#1_209|, |v_ULTIMATE.start_main_#t~ite35#1_207|, |v_ULTIMATE.start_main_#t~ite36#1_156|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite36#1, ~x$r_buff0_thd1~0, ~x$w_buff1~0, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite35#1, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] [2022-12-06 04:25:25,288 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:25:25,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-06 04:25:25,288 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 264 flow [2022-12-06 04:25:25,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:25,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:25,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:25,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:25:25,289 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1348144031, now seen corresponding path program 1 times [2022-12-06 04:25:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:25,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037159642] [2022-12-06 04:25:25,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:25,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:25,470 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-06 04:25:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:25,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037159642] [2022-12-06 04:25:25,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037159642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:25,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:25,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:25:25,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136746683] [2022-12-06 04:25:25,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:25,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:25:25,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:25,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:25:25,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:25:25,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 04:25:25,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-06 04:25:25,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:25,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 04:25:25,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:25,596 INFO L130 PetriNetUnfolder]: 245/441 cut-off events. [2022-12-06 04:25:25,596 INFO L131 PetriNetUnfolder]: For 965/967 co-relation queries the response was YES. [2022-12-06 04:25:25,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 441 events. 245/441 cut-off events. For 965/967 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1727 event pairs, 52 based on Foata normal form. 19/456 useless extension candidates. Maximal degree in co-relation 1763. Up to 188 conditions per place. [2022-12-06 04:25:25,599 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 49 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2022-12-06 04:25:25,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 496 flow [2022-12-06 04:25:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 04:25:25,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2022-12-06 04:25:25,600 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 264 flow. Second operand 5 states and 61 transitions. [2022-12-06 04:25:25,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 496 flow [2022-12-06 04:25:25,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 449 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 04:25:25,601 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 238 flow [2022-12-06 04:25:25,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-12-06 04:25:25,602 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2022-12-06 04:25:25,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:25,602 INFO L89 Accepts]: Start accepts. Operand has 47 places, 39 transitions, 238 flow [2022-12-06 04:25:25,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:25,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:25,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 39 transitions, 238 flow [2022-12-06 04:25:25,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 238 flow [2022-12-06 04:25:25,619 INFO L130 PetriNetUnfolder]: 58/157 cut-off events. [2022-12-06 04:25:25,619 INFO L131 PetriNetUnfolder]: For 246/259 co-relation queries the response was YES. [2022-12-06 04:25:25,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 157 events. 58/157 cut-off events. For 246/259 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 683 event pairs, 3 based on Foata normal form. 7/153 useless extension candidates. Maximal degree in co-relation 470. Up to 59 conditions per place. [2022-12-06 04:25:25,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 238 flow [2022-12-06 04:25:25,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 04:25:28,305 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:25:28,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2704 [2022-12-06 04:25:28,306 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 240 flow [2022-12-06 04:25:28,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-06 04:25:28,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:28,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:28,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:25:28,306 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:25:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:28,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1610062983, now seen corresponding path program 1 times [2022-12-06 04:25:28,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:28,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820702263] [2022-12-06 04:25:28,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:28,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:25:28,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:25:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:25:28,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:25:28,435 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:25:28,436 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:25:28,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:25:28,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:25:28,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:25:28,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:25:28,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:25:28,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:25:28,438 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:28,441 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:25:28,441 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:25:28,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:25:28 BasicIcfg [2022-12-06 04:25:28,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:25:28,501 INFO L158 Benchmark]: Toolchain (without parser) took 24084.27ms. Allocated memory was 189.8MB in the beginning and 716.2MB in the end (delta: 526.4MB). Free memory was 165.2MB in the beginning and 568.5MB in the end (delta: -403.3MB). Peak memory consumption was 124.4MB. Max. memory is 8.0GB. [2022-12-06 04:25:28,501 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory was 166.9MB in the beginning and 166.9MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:25:28,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.24ms. Allocated memory is still 189.8MB. Free memory was 165.2MB in the beginning and 137.6MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:25:28,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.22ms. Allocated memory is still 189.8MB. Free memory was 137.6MB in the beginning and 135.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:25:28,502 INFO L158 Benchmark]: Boogie Preprocessor took 24.31ms. Allocated memory is still 189.8MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:25:28,502 INFO L158 Benchmark]: RCFGBuilder took 952.64ms. Allocated memory was 189.8MB in the beginning and 276.8MB in the end (delta: 87.0MB). Free memory was 132.9MB in the beginning and 237.7MB in the end (delta: -104.8MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2022-12-06 04:25:28,502 INFO L158 Benchmark]: TraceAbstraction took 22630.17ms. Allocated memory was 276.8MB in the beginning and 716.2MB in the end (delta: 439.4MB). Free memory was 237.2MB in the beginning and 568.5MB in the end (delta: -331.3MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. [2022-12-06 04:25:28,503 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.10ms. Allocated memory is still 189.8MB. Free memory was 166.9MB in the beginning and 166.9MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 438.24ms. Allocated memory is still 189.8MB. Free memory was 165.2MB in the beginning and 137.6MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.22ms. Allocated memory is still 189.8MB. Free memory was 137.6MB in the beginning and 135.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.31ms. Allocated memory is still 189.8MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 952.64ms. Allocated memory was 189.8MB in the beginning and 276.8MB in the end (delta: 87.0MB). Free memory was 132.9MB in the beginning and 237.7MB in the end (delta: -104.8MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. * TraceAbstraction took 22630.17ms. Allocated memory was 276.8MB in the beginning and 716.2MB in the end (delta: 439.4MB). Free memory was 237.2MB in the beginning and 568.5MB in the end (delta: -331.3MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 132 PlacesBefore, 37 PlacesAfterwards, 124 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1471, independent: 1411, independent conditional: 1411, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1471, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1471, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1471, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1208, independent: 1166, independent conditional: 0, independent unconditional: 1166, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1208, independent: 1156, independent conditional: 0, independent unconditional: 1156, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 398, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 381, dependent conditional: 0, dependent unconditional: 381, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1471, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1208, unknown conditional: 0, unknown unconditional: 1208] , Statistics on independence cache: Total cache size (in pairs): 1839, Positive cache size: 1797, Positive conditional cache size: 0, Positive unconditional cache size: 1797, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 7, independent unconditional: 40, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 47, independent conditional: 7, independent unconditional: 40, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 47, independent conditional: 7, independent unconditional: 40, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 7, independent unconditional: 38, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 97, dependent conditional: 40, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 62, unknown conditional: 11, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 45, Positive conditional cache size: 7, Positive unconditional cache size: 38, Negative cache size: 17, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 46, independent conditional: 46, 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: 65, independent: 46, independent conditional: 9, independent unconditional: 37, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 46, dependent conditional: 2, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 21, unknown conditional: 3, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 56, Positive conditional cache size: 7, Positive unconditional cache size: 49, Negative cache size: 27, Negative conditional cache size: 7, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 40, 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: 58, independent: 40, independent conditional: 11, independent unconditional: 29, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 18, dependent conditional: 2, dependent unconditional: 16, 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: 58, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 56, Positive conditional cache size: 7, Positive unconditional cache size: 49, Negative cache size: 27, Negative conditional cache size: 7, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 45, independent conditional: 12, independent unconditional: 33, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 56, Positive conditional cache size: 7, Positive unconditional cache size: 49, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 13, independent unconditional: 33, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 67, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 58, Positive conditional cache size: 7, Positive unconditional cache size: 51, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 65, Positive conditional cache size: 7, Positive unconditional cache size: 58, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 127, independent: 87, independent conditional: 87, 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: 127, independent: 87, independent conditional: 17, independent unconditional: 70, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 127, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 127, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 71, Positive conditional cache size: 7, Positive unconditional cache size: 64, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 40 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 68, independent conditional: 62, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 68, independent conditional: 49, independent unconditional: 19, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 68, independent conditional: 49, independent unconditional: 19, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 14, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 53, independent conditional: 35, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 15, unknown conditional: 14, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 95, Positive conditional cache size: 21, Positive unconditional cache size: 74, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 45 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 119, independent conditional: 119, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 119, independent conditional: 53, independent unconditional: 66, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, independent: 119, independent conditional: 46, independent unconditional: 73, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, independent: 119, independent conditional: 46, independent unconditional: 73, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, independent: 111, independent conditional: 43, independent unconditional: 68, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 116, Positive conditional cache size: 24, Positive unconditional cache size: 92, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 116, Positive conditional cache size: 24, Positive unconditional cache size: 92, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, 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.3s, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 10, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 120, Positive conditional cache size: 24, Positive unconditional cache size: 96, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 47 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 124, Positive conditional cache size: 24, Positive unconditional cache size: 100, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=-1, t1852={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1853; [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=0, t1852={7:0}, t1853={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1854; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=1, t1852={7:0}, t1853={5:0}, t1854={6:0}, weak$$choice0=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 __unbuffered_p2_EAX = y [L828] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 [L831] EXPR 1 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 1 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 1 \read(x) [L831] EXPR 1 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 1 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 1 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 1 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 1 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 854]: 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: 858]: 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, 154 locations, 6 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: 22.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 772 IncrementalHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 10 mSDtfsCounter, 772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=11, InterpolantAutomatonStates: 47, 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.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 1005 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:25:28,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...