/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:46:41,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:46:41,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:46:41,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:46:41,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:46:41,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:46:41,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:46:41,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:46:41,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:46:41,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:46:41,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:46:41,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:46:41,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:46:41,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:46:41,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:46:41,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:46:41,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:46:41,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:46:41,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:46:41,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:46:41,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:46:41,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:46:41,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:46:41,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:46:41,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:46:41,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:46:41,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:46:41,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:46:41,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:46:41,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:46:41,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:46:41,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:46:41,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:46:41,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:46:41,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:46:41,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:46:41,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:46:41,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:46:41,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:46:41,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:46:41,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:46:41,782 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:46:41,798 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:46:41,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:46:41,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:46:41,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:46:41,800 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:46:41,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:46:41,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:46:41,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:46:41,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:46:41,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:46:41,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:46:41,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:46:41,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:46:41,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:46:41,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:46:41,802 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:46:41,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:46:41,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:46:41,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:46:41,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:46:41,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:46:42,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:46:42,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:46:42,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:46:42,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:46:42,147 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:46:42,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:46:43,148 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:46:43,396 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:46:43,397 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:46:43,406 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a460056/9d552f67db5b4227a30d6972a45d2501/FLAG2e0b35ca3 [2022-12-13 00:46:43,417 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a460056/9d552f67db5b4227a30d6972a45d2501 [2022-12-13 00:46:43,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:46:43,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:46:43,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:46:43,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:46:43,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:46:43,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:43,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65af03f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43, skipping insertion in model container [2022-12-13 00:46:43,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:43,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:46:43,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:46:43,616 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/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-13 00:46:43,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:46:43,861 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:46:43,869 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/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-13 00:46:43,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:43,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:43,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:46:43,949 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:46:43,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43 WrapperNode [2022-12-13 00:46:43,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:46:43,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:46:43,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:46:43,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:46:43,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:43,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:43,987 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 00:46:43,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:46:43,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:46:43,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:46:43,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:46:43,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:43,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:43,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:43,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:44,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:44,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:44,016 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:44,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:44,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:46:44,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:46:44,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:46:44,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:46:44,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (1/1) ... [2022-12-13 00:46:44,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:46:44,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:46:44,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:46:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:46:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:46:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:46:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:46:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:46:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:46:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:46:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:46:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:46:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:46:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:46:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:46:44,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:46:44,075 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:46:44,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:46:44,161 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:46:44,162 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:46:44,452 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:46:44,600 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:46:44,601 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:46:44,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:44 BoogieIcfgContainer [2022-12-13 00:46:44,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:46:44,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:46:44,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:46:44,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:46:44,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:46:43" (1/3) ... [2022-12-13 00:46:44,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437064ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:44, skipping insertion in model container [2022-12-13 00:46:44,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:43" (2/3) ... [2022-12-13 00:46:44,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437064ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:44, skipping insertion in model container [2022-12-13 00:46:44,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:44" (3/3) ... [2022-12-13 00:46:44,612 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:46:44,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:46:44,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:46:44,625 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:46:44,667 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:46:44,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 00:46:44,742 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 00:46:44,742 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:44,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 00:46:44,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 00:46:44,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-13 00:46:44,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:44,763 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 00:46:44,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-13 00:46:44,791 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 00:46:44,792 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:44,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 00:46:44,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 00:46:44,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-13 00:46:51,196 INFO L241 LiptonReduction]: Total number of compositions: 72 [2022-12-13 00:46:51,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:46:51,211 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;@21be18cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:46:51,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:46:51,214 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 00:46:51,214 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:51,214 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:51,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:46:51,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 475983688, now seen corresponding path program 1 times [2022-12-13 00:46:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:51,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531642775] [2022-12-13 00:46:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:51,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:51,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531642775] [2022-12-13 00:46:51,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531642775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:51,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:51,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:46:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141286024] [2022-12-13 00:46:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:51,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:46:51,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:51,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:46:51,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:46:51,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 49 [2022-12-13 00:46:51,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:51,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:51,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 49 [2022-12-13 00:46:51,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:52,241 INFO L130 PetriNetUnfolder]: 1980/3524 cut-off events. [2022-12-13 00:46:52,242 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 00:46:52,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6715 conditions, 3524 events. 1980/3524 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 23607 event pairs, 150 based on Foata normal form. 0/2038 useless extension candidates. Maximal degree in co-relation 6705. Up to 2839 conditions per place. [2022-12-13 00:46:52,250 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 25 selfloop transitions, 3 changer transitions 40/74 dead transitions. [2022-12-13 00:46:52,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 290 flow [2022-12-13 00:46:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-13 00:46:52,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2022-12-13 00:46:52,260 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 104 flow. Second operand 3 states and 93 transitions. [2022-12-13 00:46:52,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 290 flow [2022-12-13 00:46:52,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:52,264 INFO L231 Difference]: Finished difference. Result has 52 places, 25 transitions, 60 flow [2022-12-13 00:46:52,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2022-12-13 00:46:52,268 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2022-12-13 00:46:52,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:52,269 INFO L89 Accepts]: Start accepts. Operand has 52 places, 25 transitions, 60 flow [2022-12-13 00:46:52,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:52,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:52,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 25 transitions, 60 flow [2022-12-13 00:46:52,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 60 flow [2022-12-13 00:46:52,278 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 00:46:52,278 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:52,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:46:52,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 60 flow [2022-12-13 00:46:52,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-13 00:46:52,390 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:52,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 00:46:52,392 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 60 flow [2022-12-13 00:46:52,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:52,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:52,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:52,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:46:52,392 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:52,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2141146691, now seen corresponding path program 1 times [2022-12-13 00:46:52,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:52,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395020275] [2022-12-13 00:46:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:52,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:52,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:52,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395020275] [2022-12-13 00:46:52,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395020275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:52,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:52,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:52,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467622257] [2022-12-13 00:46:52,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:52,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:52,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:52,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:52,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:52,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:52,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:52,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:52,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:52,934 INFO L130 PetriNetUnfolder]: 300/555 cut-off events. [2022-12-13 00:46:52,934 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 00:46:52,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 555 events. 300/555 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2416 event pairs, 116 based on Foata normal form. 24/495 useless extension candidates. Maximal degree in co-relation 1130. Up to 345 conditions per place. [2022-12-13 00:46:52,937 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 29 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-13 00:46:52,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 150 flow [2022-12-13 00:46:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 00:46:52,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-13 00:46:52,938 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 60 flow. Second operand 3 states and 47 transitions. [2022-12-13 00:46:52,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 150 flow [2022-12-13 00:46:52,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:52,939 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:52,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=62, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 00:46:52,940 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -22 predicate places. [2022-12-13 00:46:52,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:52,940 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:52,941 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:52,941 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:52,941 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:52,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:52,944 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 00:46:52,944 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:52,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:46:52,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:52,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-13 00:46:52,993 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:52,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 00:46:52,994 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:52,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:52,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:52,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:52,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:46:52,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:52,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1414611549, now seen corresponding path program 1 times [2022-12-13 00:46:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:52,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423715063] [2022-12-13 00:46:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:53,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423715063] [2022-12-13 00:46:53,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423715063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:53,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:53,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723264975] [2022-12-13 00:46:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:53,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:53,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:53,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:53,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:53,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:53,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:53,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:53,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:53,536 INFO L130 PetriNetUnfolder]: 279/519 cut-off events. [2022-12-13 00:46:53,536 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 00:46:53,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 519 events. 279/519 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2172 event pairs, 104 based on Foata normal form. 12/454 useless extension candidates. Maximal degree in co-relation 1083. Up to 317 conditions per place. [2022-12-13 00:46:53,539 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 25 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2022-12-13 00:46:53,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 137 flow [2022-12-13 00:46:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 00:46:53,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 00:46:53,541 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 62 flow. Second operand 3 states and 44 transitions. [2022-12-13 00:46:53,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 137 flow [2022-12-13 00:46:53,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:53,542 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 64 flow [2022-12-13 00:46:53,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=64, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-13 00:46:53,543 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -21 predicate places. [2022-12-13 00:46:53,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:53,544 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 64 flow [2022-12-13 00:46:53,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:53,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:53,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 64 flow [2022-12-13 00:46:53,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 64 flow [2022-12-13 00:46:53,549 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 00:46:53,549 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:46:53,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:46:53,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 64 flow [2022-12-13 00:46:53,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 00:46:53,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:46:53,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 00:46:53,697 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 62 flow [2022-12-13 00:46:53,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:53,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:53,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:53,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:46:53,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:53,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash -860182947, now seen corresponding path program 1 times [2022-12-13 00:46:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:53,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591578863] [2022-12-13 00:46:53,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:54,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591578863] [2022-12-13 00:46:54,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591578863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:54,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:54,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:46:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478926362] [2022-12-13 00:46:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:54,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:46:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:46:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:46:54,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 00:46:54,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:54,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:54,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 00:46:54,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:54,498 INFO L130 PetriNetUnfolder]: 254/473 cut-off events. [2022-12-13 00:46:54,498 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-13 00:46:54,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 473 events. 254/473 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2012 event pairs, 20 based on Foata normal form. 5/422 useless extension candidates. Maximal degree in co-relation 1027. Up to 312 conditions per place. [2022-12-13 00:46:54,500 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 30 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2022-12-13 00:46:54,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 192 flow [2022-12-13 00:46:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:46:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:46:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 00:46:54,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5144927536231884 [2022-12-13 00:46:54,501 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 62 flow. Second operand 6 states and 71 transitions. [2022-12-13 00:46:54,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 192 flow [2022-12-13 00:46:54,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:54,503 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 124 flow [2022-12-13 00:46:54,503 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-13 00:46:54,503 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -18 predicate places. [2022-12-13 00:46:54,503 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:54,503 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 124 flow [2022-12-13 00:46:54,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:54,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:54,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 124 flow [2022-12-13 00:46:54,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 124 flow [2022-12-13 00:46:54,512 INFO L130 PetriNetUnfolder]: 21/83 cut-off events. [2022-12-13 00:46:54,512 INFO L131 PetriNetUnfolder]: For 29/32 co-relation queries the response was YES. [2022-12-13 00:46:54,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 83 events. 21/83 cut-off events. For 29/32 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 338 event pairs, 3 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 170. Up to 38 conditions per place. [2022-12-13 00:46:54,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 124 flow [2022-12-13 00:46:54,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-13 00:46:54,519 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:54,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 00:46:54,524 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 124 flow [2022-12-13 00:46:54,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:54,525 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:54,525 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:54,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:46:54,525 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1484762763, now seen corresponding path program 2 times [2022-12-13 00:46:54,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:54,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393056554] [2022-12-13 00:46:54,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:54,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:55,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:55,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393056554] [2022-12-13 00:46:55,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393056554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:55,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:55,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:46:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796138805] [2022-12-13 00:46:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:55,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:46:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:46:55,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:46:55,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 00:46:55,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 124 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:55,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:55,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 00:46:55,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:55,452 INFO L130 PetriNetUnfolder]: 259/486 cut-off events. [2022-12-13 00:46:55,452 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 00:46:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 486 events. 259/486 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2106 event pairs, 23 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 1335. Up to 329 conditions per place. [2022-12-13 00:46:55,460 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 36 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2022-12-13 00:46:55,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 340 flow [2022-12-13 00:46:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:46:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:46:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-12-13 00:46:55,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4945652173913043 [2022-12-13 00:46:55,463 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 124 flow. Second operand 8 states and 91 transitions. [2022-12-13 00:46:55,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 340 flow [2022-12-13 00:46:55,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:46:55,468 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 267 flow [2022-12-13 00:46:55,468 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=267, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2022-12-13 00:46:55,470 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -9 predicate places. [2022-12-13 00:46:55,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:55,470 INFO L89 Accepts]: Start accepts. Operand has 46 places, 44 transitions, 267 flow [2022-12-13 00:46:55,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:55,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:55,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 44 transitions, 267 flow [2022-12-13 00:46:55,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 44 transitions, 267 flow [2022-12-13 00:46:55,486 INFO L130 PetriNetUnfolder]: 41/130 cut-off events. [2022-12-13 00:46:55,486 INFO L131 PetriNetUnfolder]: For 157/164 co-relation queries the response was YES. [2022-12-13 00:46:55,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 130 events. 41/130 cut-off events. For 157/164 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 576 event pairs, 5 based on Foata normal form. 3/105 useless extension candidates. Maximal degree in co-relation 393. Up to 61 conditions per place. [2022-12-13 00:46:55,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 44 transitions, 267 flow [2022-12-13 00:46:55,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-13 00:46:55,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_332 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_332, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [482] $Ultimate##0-->L796: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_48| |v_P1Thread1of1ForFork1_~arg#1.offset_48|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~x$w_buff0~0_416 v_~x$w_buff1~0_385) (= v_~x$r_buff0_thd0~0_328 v_~x$r_buff1_thd0~0_325) (= v_~x$r_buff0_thd1~0_218 v_~x$r_buff1_thd1~0_227) (= 2 v_~x$w_buff0~0_415) (= v_~x$w_buff0_used~0_624 v_~x$w_buff1_used~0_561) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_48| |v_P1Thread1of1ForFork1_~arg#1.base_48|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_623 256) 0)) (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= v_~x$w_buff0_used~0_623 1) (= v_~y~0_43 1) (= v_~y~0_43 v_~__unbuffered_p1_EAX~0_91) (= v_~x$r_buff0_thd2~0_242 1) (= v_~x$r_buff0_thd2~0_243 v_~x$r_buff1_thd2~0_192)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_416, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_243, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_415, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_48|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_48|, ~x$w_buff1~0=v_~x$w_buff1~0_385, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_227, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_242, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_325, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_623, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 00:46:55,722 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:46:55,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-13 00:46:55,724 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 268 flow [2022-12-13 00:46:55,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:55,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:55,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:55,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:46:55,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2100969313, now seen corresponding path program 1 times [2022-12-13 00:46:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:55,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991438698] [2022-12-13 00:46:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:56,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:56,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991438698] [2022-12-13 00:46:56,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991438698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:56,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:56,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:46:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415376470] [2022-12-13 00:46:56,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:56,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:46:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:56,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:46:56,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:46:56,645 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:56,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 268 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:56,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:56,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:56,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:56,832 INFO L130 PetriNetUnfolder]: 272/509 cut-off events. [2022-12-13 00:46:56,832 INFO L131 PetriNetUnfolder]: For 801/801 co-relation queries the response was YES. [2022-12-13 00:46:56,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 509 events. 272/509 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2248 event pairs, 50 based on Foata normal form. 3/451 useless extension candidates. Maximal degree in co-relation 1730. Up to 381 conditions per place. [2022-12-13 00:46:56,851 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 37 selfloop transitions, 11 changer transitions 0/53 dead transitions. [2022-12-13 00:46:56,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 400 flow [2022-12-13 00:46:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-13 00:46:56,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-13 00:46:56,853 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 268 flow. Second operand 4 states and 56 transitions. [2022-12-13 00:46:56,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 400 flow [2022-12-13 00:46:56,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 391 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 00:46:56,857 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 313 flow [2022-12-13 00:46:56,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-12-13 00:46:56,857 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2022-12-13 00:46:56,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:56,858 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 313 flow [2022-12-13 00:46:56,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:56,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:56,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 313 flow [2022-12-13 00:46:56,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 313 flow [2022-12-13 00:46:56,876 INFO L130 PetriNetUnfolder]: 43/139 cut-off events. [2022-12-13 00:46:56,877 INFO L131 PetriNetUnfolder]: For 274/304 co-relation queries the response was YES. [2022-12-13 00:46:56,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 139 events. 43/139 cut-off events. For 274/304 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 643 event pairs, 4 based on Foata normal form. 4/112 useless extension candidates. Maximal degree in co-relation 457. Up to 62 conditions per place. [2022-12-13 00:46:56,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 313 flow [2022-12-13 00:46:56,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-13 00:46:56,880 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:56,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 00:46:56,880 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 313 flow [2022-12-13 00:46:56,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:56,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:56,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:56,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:46:56,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 59521396, now seen corresponding path program 1 times [2022-12-13 00:46:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:56,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409389858] [2022-12-13 00:46:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:57,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:57,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409389858] [2022-12-13 00:46:57,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409389858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:57,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:57,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:46:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771421055] [2022-12-13 00:46:57,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:57,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:57,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:57,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:57,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:57,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:57,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:57,207 INFO L130 PetriNetUnfolder]: 380/728 cut-off events. [2022-12-13 00:46:57,207 INFO L131 PetriNetUnfolder]: For 1601/1601 co-relation queries the response was YES. [2022-12-13 00:46:57,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 728 events. 380/728 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3727 event pairs, 127 based on Foata normal form. 16/648 useless extension candidates. Maximal degree in co-relation 2556. Up to 358 conditions per place. [2022-12-13 00:46:57,211 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 39 selfloop transitions, 8 changer transitions 21/73 dead transitions. [2022-12-13 00:46:57,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 628 flow [2022-12-13 00:46:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 00:46:57,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-13 00:46:57,212 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 313 flow. Second operand 4 states and 61 transitions. [2022-12-13 00:46:57,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 628 flow [2022-12-13 00:46:57,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 606 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:57,216 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 365 flow [2022-12-13 00:46:57,216 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-13 00:46:57,216 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2022-12-13 00:46:57,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:57,217 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 365 flow [2022-12-13 00:46:57,217 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:57,217 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:57,217 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 365 flow [2022-12-13 00:46:57,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 365 flow [2022-12-13 00:46:57,230 INFO L130 PetriNetUnfolder]: 39/135 cut-off events. [2022-12-13 00:46:57,231 INFO L131 PetriNetUnfolder]: For 384/388 co-relation queries the response was YES. [2022-12-13 00:46:57,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 135 events. 39/135 cut-off events. For 384/388 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 648 event pairs, 2 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 476. Up to 56 conditions per place. [2022-12-13 00:46:57,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 48 transitions, 365 flow [2022-12-13 00:46:57,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 00:46:57,233 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:57,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 00:46:57,234 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 365 flow [2022-12-13 00:46:57,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:57,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:57,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:57,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:46:57,234 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1435647105, now seen corresponding path program 2 times [2022-12-13 00:46:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:57,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019720551] [2022-12-13 00:46:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:58,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019720551] [2022-12-13 00:46:58,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019720551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:58,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:58,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:46:58,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126817182] [2022-12-13 00:46:58,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:58,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:46:58,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:46:58,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:46:58,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:58,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 365 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:58,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:58,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:58,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:58,436 INFO L130 PetriNetUnfolder]: 225/448 cut-off events. [2022-12-13 00:46:58,436 INFO L131 PetriNetUnfolder]: For 1193/1193 co-relation queries the response was YES. [2022-12-13 00:46:58,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 448 events. 225/448 cut-off events. For 1193/1193 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2058 event pairs, 24 based on Foata normal form. 3/393 useless extension candidates. Maximal degree in co-relation 1659. Up to 300 conditions per place. [2022-12-13 00:46:58,439 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 43 selfloop transitions, 18 changer transitions 0/66 dead transitions. [2022-12-13 00:46:58,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 555 flow [2022-12-13 00:46:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:46:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:46:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-13 00:46:58,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2022-12-13 00:46:58,440 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 365 flow. Second operand 6 states and 79 transitions. [2022-12-13 00:46:58,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 555 flow [2022-12-13 00:46:58,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 543 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:58,443 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 424 flow [2022-12-13 00:46:58,443 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2022-12-13 00:46:58,444 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2022-12-13 00:46:58,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:58,444 INFO L89 Accepts]: Start accepts. Operand has 54 places, 50 transitions, 424 flow [2022-12-13 00:46:58,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:58,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:58,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 50 transitions, 424 flow [2022-12-13 00:46:58,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 50 transitions, 424 flow [2022-12-13 00:46:58,459 INFO L130 PetriNetUnfolder]: 41/146 cut-off events. [2022-12-13 00:46:58,459 INFO L131 PetriNetUnfolder]: For 404/408 co-relation queries the response was YES. [2022-12-13 00:46:58,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 146 events. 41/146 cut-off events. For 404/408 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 730 event pairs, 4 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 543. Up to 59 conditions per place. [2022-12-13 00:46:58,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 50 transitions, 424 flow [2022-12-13 00:46:58,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-13 00:46:58,462 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:58,462 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 00:46:58,462 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 424 flow [2022-12-13 00:46:58,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:58,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:58,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:58,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:46:58,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2009351904, now seen corresponding path program 2 times [2022-12-13 00:46:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:58,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426752742] [2022-12-13 00:46:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:58,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426752742] [2022-12-13 00:46:58,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426752742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:58,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:58,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:46:58,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855945674] [2022-12-13 00:46:58,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:58,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:46:58,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:58,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:46:58,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:46:58,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:58,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:58,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:58,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:58,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:59,060 INFO L130 PetriNetUnfolder]: 356/731 cut-off events. [2022-12-13 00:46:59,060 INFO L131 PetriNetUnfolder]: For 1991/1991 co-relation queries the response was YES. [2022-12-13 00:46:59,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2582 conditions, 731 events. 356/731 cut-off events. For 1991/1991 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4077 event pairs, 71 based on Foata normal form. 32/651 useless extension candidates. Maximal degree in co-relation 2560. Up to 231 conditions per place. [2022-12-13 00:46:59,064 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 34 selfloop transitions, 17 changer transitions 37/93 dead transitions. [2022-12-13 00:46:59,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 834 flow [2022-12-13 00:46:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:46:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:46:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-12-13 00:46:59,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 00:46:59,065 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 424 flow. Second operand 7 states and 100 transitions. [2022-12-13 00:46:59,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 834 flow [2022-12-13 00:46:59,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 805 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:46:59,070 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 474 flow [2022-12-13 00:46:59,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-12-13 00:46:59,070 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2022-12-13 00:46:59,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:59,070 INFO L89 Accepts]: Start accepts. Operand has 59 places, 50 transitions, 474 flow [2022-12-13 00:46:59,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:59,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:59,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 50 transitions, 474 flow [2022-12-13 00:46:59,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 474 flow [2022-12-13 00:46:59,109 INFO L130 PetriNetUnfolder]: 29/116 cut-off events. [2022-12-13 00:46:59,109 INFO L131 PetriNetUnfolder]: For 463/470 co-relation queries the response was YES. [2022-12-13 00:46:59,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 116 events. 29/116 cut-off events. For 463/470 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 535 event pairs, 2 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 491. Up to 45 conditions per place. [2022-12-13 00:46:59,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 50 transitions, 474 flow [2022-12-13 00:46:59,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 00:46:59,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] $Ultimate##0-->L749: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_250 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_675 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_241 256) 0)))) (let ((.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_676 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_612 256) 0))))) (and (= v_~x$w_buff0_used~0_675 (ite .cse0 0 v_~x$w_buff0_used~0_676)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_612) v_~x$w_buff1_used~0_611) (= v_~x$r_buff0_thd1~0_240 (ite .cse2 0 v_~x$r_buff0_thd1~0_241)) (= v_P0Thread1of1ForFork0_~arg.offset_34 |v_P0Thread1of1ForFork0_#in~arg.offset_34|) (= (ite (or (and .cse3 (not (= 0 (mod v_~x$r_buff0_thd1~0_240 256)))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_611 256) 0)))) 0 v_~x$r_buff1_thd1~0_250) v_~x$r_buff1_thd1~0_249) (= (ite .cse0 v_~x$w_buff0~0_443 (ite .cse1 v_~x$w_buff1~0_411 1)) v_~x~0_582) (= v_P0Thread1of1ForFork0_~arg.base_34 |v_P0Thread1of1ForFork0_#in~arg.base_34|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_443, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_241, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_34|, ~x$w_buff1~0=v_~x$w_buff1~0_411, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_34|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_612, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_250, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_676} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_443, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_240, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_34|, ~x$w_buff1~0=v_~x$w_buff1~0_411, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_34|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_611, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_249, ~x~0=v_~x~0_582, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_34, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_675} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [482] $Ultimate##0-->L796: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_48| |v_P1Thread1of1ForFork1_~arg#1.offset_48|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~x$w_buff0~0_416 v_~x$w_buff1~0_385) (= v_~x$r_buff0_thd0~0_328 v_~x$r_buff1_thd0~0_325) (= v_~x$r_buff0_thd1~0_218 v_~x$r_buff1_thd1~0_227) (= 2 v_~x$w_buff0~0_415) (= v_~x$w_buff0_used~0_624 v_~x$w_buff1_used~0_561) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_48| |v_P1Thread1of1ForFork1_~arg#1.base_48|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_623 256) 0)) (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= v_~x$w_buff0_used~0_623 1) (= v_~y~0_43 1) (= v_~y~0_43 v_~__unbuffered_p1_EAX~0_91) (= v_~x$r_buff0_thd2~0_242 1) (= v_~x$r_buff0_thd2~0_243 v_~x$r_buff1_thd2~0_192)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_416, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_243, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_415, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_48|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_48|, ~x$w_buff1~0=v_~x$w_buff1~0_385, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_227, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_242, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_325, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_623, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 00:47:00,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] $Ultimate##0-->L765: Formula: (let ((.cse23 (not (= (mod v_~x$r_buff0_thd1~0_258 256) 0)))) (let ((.cse13 (and .cse23 (not (= 0 (mod v_~x$w_buff0_used~0_705 256)))))) (let ((.cse10 (ite .cse13 0 v_~x$w_buff0_used~0_705))) (let ((.cse18 (= (mod .cse10 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse20 (not (= (mod v_~x$r_buff1_thd1~0_269 256) 0))) (.cse2 (ite .cse22 0 v_~x$r_buff0_thd1~0_258))) (let ((.cse6 (= (mod .cse2 256) 0)) (.cse14 (and (not (= (mod v_~x$w_buff1_used~0_639 256) 0)) .cse20))) (let ((.cse8 (ite (or .cse14 .cse22) 0 v_~x$w_buff1_used~0_639)) (.cse7 (not .cse6))) (let ((.cse12 (and .cse7 .cse21)) (.cse19 (= (mod .cse8 256) 0))) (let ((.cse15 (ite (or .cse12 (and .cse20 (not .cse19))) 0 v_~x$r_buff1_thd1~0_269))) (let ((.cse17 (= (mod .cse15 256) 0))) (let ((.cse3 (and .cse6 .cse17)) (.cse9 (and .cse19 .cse6))) (let ((.cse11 (or .cse3 .cse9 .cse18))) (let ((.cse0 (ite .cse11 v_~x$mem_tmp~0_169 (ite .cse12 v_~x$w_buff0~0_462 v_~x$w_buff1~0_428))) (.cse1 (not (= (mod v_~weak$$choice2~0_205 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_703 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_637 256) 0))) (and (= v_~__unbuffered_p0_EAX~0_115 .cse0) (= v_P0Thread1of1ForFork0_~arg.base_43 |v_P0Thread1of1ForFork0_#in~arg.base_43|) (= |v_P0Thread1of1ForFork0_#t~nondet4_34| v_~weak$$choice2~0_205) (= v_~x$w_buff0~0_462 v_~x$w_buff0~0_461) (= (ite .cse1 v_~x$mem_tmp~0_169 .cse0) v_~x~0_604) (= (ite .cse1 .cse2 (ite (or .cse3 .cse4 (and .cse5 .cse6)) .cse2 (ite (and (not .cse4) .cse7) 0 .cse2))) v_~x$r_buff0_thd1~0_256) (= (ite .cse1 .cse8 (ite (or .cse3 .cse9 .cse4) .cse8 0)) v_~x$w_buff1_used~0_637) (= v_P0Thread1of1ForFork0_~arg.offset_43 |v_P0Thread1of1ForFork0_#in~arg.offset_43|) (= v_~x$w_buff1~0_428 v_~x$w_buff1~0_427) (= (ite .cse1 .cse10 (ite .cse11 .cse10 (ite .cse12 0 .cse10))) v_~x$w_buff0_used~0_703) (= (ite .cse13 v_~x$w_buff0~0_462 (ite .cse14 v_~x$w_buff1~0_428 1)) v_~x$mem_tmp~0_169) (= v_~x$r_buff1_thd1~0_267 (ite .cse1 .cse15 (ite (let ((.cse16 (= (mod v_~x$r_buff0_thd1~0_256 256) 0))) (or .cse4 (and .cse16 .cse17) (and .cse5 .cse16))) .cse15 0))) (= v_~x$flush_delayed~0_198 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_34| v_~weak$$choice0~0_134))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_462, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_258, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_43|, ~x$w_buff1~0=v_~x$w_buff1~0_428, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_639, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_269, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_34|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_34|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_705} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_461, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_256, ~x$flush_delayed~0=v_~x$flush_delayed~0_198, ~x$w_buff1~0=v_~x$w_buff1~0_427, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_637, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_267, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_703, ~weak$$choice0~0=v_~weak$$choice0~0_134, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_43|, ~weak$$choice2~0=v_~weak$$choice2~0_205, ~x~0=v_~x~0_604, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_43} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [482] $Ultimate##0-->L796: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_48| |v_P1Thread1of1ForFork1_~arg#1.offset_48|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~x$w_buff0~0_416 v_~x$w_buff1~0_385) (= v_~x$r_buff0_thd0~0_328 v_~x$r_buff1_thd0~0_325) (= v_~x$r_buff0_thd1~0_218 v_~x$r_buff1_thd1~0_227) (= 2 v_~x$w_buff0~0_415) (= v_~x$w_buff0_used~0_624 v_~x$w_buff1_used~0_561) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_48| |v_P1Thread1of1ForFork1_~arg#1.base_48|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_623 256) 0)) (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= v_~x$w_buff0_used~0_623 1) (= v_~y~0_43 1) (= v_~y~0_43 v_~__unbuffered_p1_EAX~0_91) (= v_~x$r_buff0_thd2~0_242 1) (= v_~x$r_buff0_thd2~0_243 v_~x$r_buff1_thd2~0_192)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_416, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_243, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_415, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_48|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_48|, ~x$w_buff1~0=v_~x$w_buff1~0_385, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_227, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_242, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_325, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_623, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 00:47:00,826 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:47:00,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1757 [2022-12-13 00:47:00,827 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 488 flow [2022-12-13 00:47:00,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:00,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:00,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:00,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:47:00,828 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash -346163995, now seen corresponding path program 1 times [2022-12-13 00:47:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:00,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299186182] [2022-12-13 00:47:00,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:02,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299186182] [2022-12-13 00:47:02,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299186182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:02,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:02,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:47:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086455818] [2022-12-13 00:47:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:02,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:47:02,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:02,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:47:02,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:47:02,430 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2022-12-13 00:47:02,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:02,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:02,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2022-12-13 00:47:02,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:02,602 INFO L130 PetriNetUnfolder]: 149/316 cut-off events. [2022-12-13 00:47:02,602 INFO L131 PetriNetUnfolder]: For 1418/1418 co-relation queries the response was YES. [2022-12-13 00:47:02,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 316 events. 149/316 cut-off events. For 1418/1418 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1384 event pairs, 34 based on Foata normal form. 3/275 useless extension candidates. Maximal degree in co-relation 1371. Up to 227 conditions per place. [2022-12-13 00:47:02,604 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 36 selfloop transitions, 13 changer transitions 6/59 dead transitions. [2022-12-13 00:47:02,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 635 flow [2022-12-13 00:47:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 00:47:02,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2022-12-13 00:47:02,605 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 488 flow. Second operand 5 states and 62 transitions. [2022-12-13 00:47:02,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 635 flow [2022-12-13 00:47:02,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 575 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 00:47:02,609 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 468 flow [2022-12-13 00:47:02,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=468, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-13 00:47:02,611 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2022-12-13 00:47:02,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:02,611 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 468 flow [2022-12-13 00:47:02,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:02,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:02,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 468 flow [2022-12-13 00:47:02,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 468 flow [2022-12-13 00:47:02,624 INFO L130 PetriNetUnfolder]: 28/116 cut-off events. [2022-12-13 00:47:02,624 INFO L131 PetriNetUnfolder]: For 431/431 co-relation queries the response was YES. [2022-12-13 00:47:02,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 116 events. 28/116 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 557 event pairs, 3 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 491. Up to 46 conditions per place. [2022-12-13 00:47:02,625 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 468 flow [2022-12-13 00:47:02,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 00:47:02,625 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:02,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 00:47:02,626 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 468 flow [2022-12-13 00:47:02,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:02,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:02,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:02,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:47:02,626 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:02,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:02,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1954453004, now seen corresponding path program 1 times [2022-12-13 00:47:02,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:02,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977170165] [2022-12-13 00:47:02,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:02,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:03,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977170165] [2022-12-13 00:47:03,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977170165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:03,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:03,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919428890] [2022-12-13 00:47:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:03,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:03,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:03,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:03,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-13 00:47:03,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 468 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:03,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:03,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-13 00:47:03,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:03,509 INFO L130 PetriNetUnfolder]: 167/352 cut-off events. [2022-12-13 00:47:03,509 INFO L131 PetriNetUnfolder]: For 1561/1561 co-relation queries the response was YES. [2022-12-13 00:47:03,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1592 conditions, 352 events. 167/352 cut-off events. For 1561/1561 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1632 event pairs, 16 based on Foata normal form. 6/307 useless extension candidates. Maximal degree in co-relation 1569. Up to 233 conditions per place. [2022-12-13 00:47:03,511 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 41 selfloop transitions, 20 changer transitions 0/65 dead transitions. [2022-12-13 00:47:03,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 715 flow [2022-12-13 00:47:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-13 00:47:03,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.488 [2022-12-13 00:47:03,513 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 468 flow. Second operand 5 states and 61 transitions. [2022-12-13 00:47:03,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 715 flow [2022-12-13 00:47:03,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 642 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 00:47:03,516 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 550 flow [2022-12-13 00:47:03,516 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=550, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2022-12-13 00:47:03,517 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2022-12-13 00:47:03,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:03,517 INFO L89 Accepts]: Start accepts. Operand has 53 places, 55 transitions, 550 flow [2022-12-13 00:47:03,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:03,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:03,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 55 transitions, 550 flow [2022-12-13 00:47:03,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 550 flow [2022-12-13 00:47:03,532 INFO L130 PetriNetUnfolder]: 34/137 cut-off events. [2022-12-13 00:47:03,532 INFO L131 PetriNetUnfolder]: For 477/489 co-relation queries the response was YES. [2022-12-13 00:47:03,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 137 events. 34/137 cut-off events. For 477/489 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 720 event pairs, 2 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 601. Up to 55 conditions per place. [2022-12-13 00:47:03,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 55 transitions, 550 flow [2022-12-13 00:47:03,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-13 00:47:04,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:47:04,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 649 [2022-12-13 00:47:04,166 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 560 flow [2022-12-13 00:47:04,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:04,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:04,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:04,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:47:04,166 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2140462643, now seen corresponding path program 1 times [2022-12-13 00:47:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:04,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860556876] [2022-12-13 00:47:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:04,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860556876] [2022-12-13 00:47:04,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860556876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:04,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:04,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530286582] [2022-12-13 00:47:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:04,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 00:47:04,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 560 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:04,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:04,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 00:47:04,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:05,142 INFO L130 PetriNetUnfolder]: 175/383 cut-off events. [2022-12-13 00:47:05,142 INFO L131 PetriNetUnfolder]: For 1603/1603 co-relation queries the response was YES. [2022-12-13 00:47:05,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 383 events. 175/383 cut-off events. For 1603/1603 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1894 event pairs, 52 based on Foata normal form. 16/340 useless extension candidates. Maximal degree in co-relation 1667. Up to 298 conditions per place. [2022-12-13 00:47:05,145 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 46 selfloop transitions, 20 changer transitions 5/75 dead transitions. [2022-12-13 00:47:05,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 806 flow [2022-12-13 00:47:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:47:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:47:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 00:47:05,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3798076923076923 [2022-12-13 00:47:05,146 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 560 flow. Second operand 8 states and 79 transitions. [2022-12-13 00:47:05,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 806 flow [2022-12-13 00:47:05,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 799 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 00:47:05,151 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 674 flow [2022-12-13 00:47:05,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=674, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2022-12-13 00:47:05,151 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2022-12-13 00:47:05,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:05,151 INFO L89 Accepts]: Start accepts. Operand has 63 places, 60 transitions, 674 flow [2022-12-13 00:47:05,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:05,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:05,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 60 transitions, 674 flow [2022-12-13 00:47:05,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 674 flow [2022-12-13 00:47:05,174 INFO L130 PetriNetUnfolder]: 34/152 cut-off events. [2022-12-13 00:47:05,174 INFO L131 PetriNetUnfolder]: For 657/670 co-relation queries the response was YES. [2022-12-13 00:47:05,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 152 events. 34/152 cut-off events. For 657/670 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 838 event pairs, 3 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 720. Up to 62 conditions per place. [2022-12-13 00:47:05,175 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 60 transitions, 674 flow [2022-12-13 00:47:05,175 INFO L226 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-13 00:47:05,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] $Ultimate##0-->L796: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff0_thd1~0_253 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_699 256) 0)) .cse2))) (let ((.cse0 (ite .cse1 0 v_~x$w_buff0_used~0_699))) (and (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_697 256) 0)) (not (= (mod v_~x$w_buff1_used~0_631 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|) (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_97) (= v_~x$w_buff0_used~0_697 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_52| |v_P1Thread1of1ForFork1_~arg#1.base_52|) (= .cse0 v_~x$w_buff1_used~0_631) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_58| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|) (= (ite .cse1 v_~x$w_buff0~0_458 (ite (and (not (= (mod v_~x$r_buff1_thd1~0_263 256) 0)) (not (= (mod v_~x$w_buff1_used~0_633 256) 0))) v_~x$w_buff1~0_424 1)) v_~x~0_602) (= (ite (and .cse2 (not (= (mod .cse0 256) 0))) 0 v_~x$r_buff0_thd1~0_253) v_~x$r_buff0_thd1~0_252) (= v_~x$r_buff0_thd1~0_252 v_~x$r_buff1_thd1~0_261) (= v_~x$r_buff0_thd2~0_251 v_~x$r_buff1_thd2~0_196) (= v_~y~0_47 1) (= 2 v_~x$w_buff0~0_457) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_58| 0)) (= v_~x$r_buff0_thd2~0_250 1) (= v_~x$r_buff0_thd0~0_386 v_~x$r_buff1_thd0~0_383) (= v_P0Thread1of1ForFork0_~arg.base_41 |v_P0Thread1of1ForFork0_#in~arg.base_41|) (= v_P0Thread1of1ForFork0_~arg.offset_41 |v_P0Thread1of1ForFork0_#in~arg.offset_41|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_52| |v_P1Thread1of1ForFork1_~arg#1.offset_52|) (= v_~x$w_buff0~0_458 v_~x$w_buff1~0_423))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_458, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_52|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_386, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_253, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_41|, ~x$w_buff1~0=v_~x$w_buff1~0_424, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_41|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_633, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_263, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_251, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_699, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_52|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_457, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_386, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_252, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_52|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_52|, ~x$w_buff1~0=v_~x$w_buff1~0_423, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_41|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_631, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_261, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_250, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_383, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_41, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_58|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_697, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_52|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_52|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_58|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_602, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_41} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 00:47:05,528 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [363] L796-->L812: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_63 256) 0))) (let ((.cse10 (not .cse9)) (.cse1 (and .cse9 .cse8)) (.cse2 (and (= (mod v_~x$w_buff1_used~0_181 256) 0) .cse9)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse4 (or .cse1 .cse2 .cse11)) (.cse5 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_52 v_~__unbuffered_p1_EBX~0_22) v_~x~0_163) (= v_~x$w_buff0~0_96 v_~x$w_buff0~0_95) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_19) (= v_~x$mem_tmp~0_52 v_~x~0_165) (= (ite .cse0 v_~x$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_181 0)) v_~x$w_buff1_used~0_180) (= v_~x$w_buff1~0_97 v_~x$w_buff1~0_96) (= v_~x$w_buff0_used~0_203 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~x$r_buff1_thd2~0_56 0))) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse4 v_~x~0_165 (ite .cse5 v_~x$w_buff0~0_96 v_~x$w_buff1~0_97))) (= v_~x$r_buff0_thd2~0_62 (ite .cse0 v_~x$r_buff0_thd2~0_63 (ite (or .cse1 .cse3 (and .cse7 .cse9)) v_~x$r_buff0_thd2~0_63 (ite (and (not .cse3) .cse10) 0 v_~x$r_buff0_thd2~0_63)))) (= v_~x$flush_delayed~0_81 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_181, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_165, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~x$flush_delayed~0=v_~x$flush_delayed~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] and [354] L765-->L772: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_40 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_88 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd1~0_43 (ite .cse0 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_39 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0)))) 0 v_~x$r_buff1_thd1~0_40)) (= v_~x$w_buff0_used~0_87 (ite .cse3 0 v_~x$w_buff0_used~0_88)) (= v_~x~0_49 (ite .cse3 v_~x$w_buff0~0_31 (ite .cse4 v_~x$w_buff1~0_32 v_~x~0_50))) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73) v_~x$w_buff1_used~0_72)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:47:05,745 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:47:05,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 595 [2022-12-13 00:47:05,746 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 683 flow [2022-12-13 00:47:05,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:05,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:05,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:05,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:47:05,746 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:05,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2142999962, now seen corresponding path program 2 times [2022-12-13 00:47:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:05,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660841817] [2022-12-13 00:47:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:05,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:06,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:06,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660841817] [2022-12-13 00:47:06,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660841817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:06,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:06,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96526309] [2022-12-13 00:47:06,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:06,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:06,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:06,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:06,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:47:06,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 683 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:06,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:06,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:47:06,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:06,576 INFO L130 PetriNetUnfolder]: 175/394 cut-off events. [2022-12-13 00:47:06,576 INFO L131 PetriNetUnfolder]: For 2280/2280 co-relation queries the response was YES. [2022-12-13 00:47:06,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 394 events. 175/394 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1992 event pairs, 31 based on Foata normal form. 15/347 useless extension candidates. Maximal degree in co-relation 1827. Up to 220 conditions per place. [2022-12-13 00:47:06,579 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 44 selfloop transitions, 19 changer transitions 2/69 dead transitions. [2022-12-13 00:47:06,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 855 flow [2022-12-13 00:47:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-13 00:47:06,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2022-12-13 00:47:06,580 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 683 flow. Second operand 5 states and 56 transitions. [2022-12-13 00:47:06,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 855 flow [2022-12-13 00:47:06,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 805 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 00:47:06,585 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 699 flow [2022-12-13 00:47:06,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=699, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2022-12-13 00:47:06,585 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2022-12-13 00:47:06,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:06,585 INFO L89 Accepts]: Start accepts. Operand has 64 places, 61 transitions, 699 flow [2022-12-13 00:47:06,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:06,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:06,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 61 transitions, 699 flow [2022-12-13 00:47:06,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 61 transitions, 699 flow [2022-12-13 00:47:06,601 INFO L130 PetriNetUnfolder]: 32/157 cut-off events. [2022-12-13 00:47:06,601 INFO L131 PetriNetUnfolder]: For 746/760 co-relation queries the response was YES. [2022-12-13 00:47:06,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 157 events. 32/157 cut-off events. For 746/760 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 897 event pairs, 3 based on Foata normal form. 3/122 useless extension candidates. Maximal degree in co-relation 742. Up to 61 conditions per place. [2022-12-13 00:47:06,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 61 transitions, 699 flow [2022-12-13 00:47:06,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-13 00:47:06,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [363] L796-->L812: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_63 256) 0))) (let ((.cse10 (not .cse9)) (.cse1 (and .cse9 .cse8)) (.cse2 (and (= (mod v_~x$w_buff1_used~0_181 256) 0) .cse9)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse4 (or .cse1 .cse2 .cse11)) (.cse5 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_52 v_~__unbuffered_p1_EBX~0_22) v_~x~0_163) (= v_~x$w_buff0~0_96 v_~x$w_buff0~0_95) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_19) (= v_~x$mem_tmp~0_52 v_~x~0_165) (= (ite .cse0 v_~x$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_181 0)) v_~x$w_buff1_used~0_180) (= v_~x$w_buff1~0_97 v_~x$w_buff1~0_96) (= v_~x$w_buff0_used~0_203 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~x$r_buff1_thd2~0_56 0))) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse4 v_~x~0_165 (ite .cse5 v_~x$w_buff0~0_96 v_~x$w_buff1~0_97))) (= v_~x$r_buff0_thd2~0_62 (ite .cse0 v_~x$r_buff0_thd2~0_63 (ite (or .cse1 .cse3 (and .cse7 .cse9)) v_~x$r_buff0_thd2~0_63 (ite (and (not .cse3) .cse10) 0 v_~x$r_buff0_thd2~0_63)))) (= v_~x$flush_delayed~0_81 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_181, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_165, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~x$flush_delayed~0=v_~x$flush_delayed~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 00:47:06,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [491] L796-->L772: Formula: (let ((.cse8 (= 0 (mod v_~x$r_buff1_thd2~0_203 256))) (.cse14 (= (mod v_~x$r_buff0_thd2~0_263 256) 0))) (let ((.cse16 (not .cse14)) (.cse20 (= (mod v_~x$w_buff0_used~0_737 256) 0)) (.cse19 (and .cse14 (= (mod v_~x$w_buff1_used~0_671 256) 0))) (.cse13 (and .cse14 .cse8))) (let ((.cse5 (not (= (mod v_~weak$$choice2~0_216 256) 0))) (.cse11 (or .cse20 .cse19 .cse13)) (.cse12 (and (not .cse20) .cse16))) (let ((.cse17 (ite .cse5 v_~x$w_buff0_used~0_737 (ite .cse11 v_~x$w_buff0_used~0_737 (ite .cse12 0 v_~x$w_buff0_used~0_737))))) (let ((.cse9 (= (mod .cse17 256) 0))) (let ((.cse4 (ite .cse5 v_~x$w_buff1_used~0_671 (ite (or .cse19 .cse13 .cse9) v_~x$w_buff1_used~0_671 0)))) (let ((.cse15 (not .cse9)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_735 256) 0))) (.cse18 (not (= (mod v_~x$r_buff0_thd1~0_279 256) 0))) (.cse6 (= (mod .cse4 256) 0)) (.cse1 (not (= 0 (mod v_~x$r_buff1_thd1~0_292 256))))) (let ((.cse3 (and (not .cse6) .cse1)) (.cse2 (and .cse0 .cse18)) (.cse10 (and .cse15 .cse18))) (and (= v_~weak$$choice0~0_145 |v_P1Thread1of1ForFork1_#t~nondet5#1_38|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_278 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_669 256) 0)) .cse1)) 0 v_~x$r_buff1_thd1~0_292) v_~x$r_buff1_thd1~0_291) (= v_~x$w_buff1_used~0_669 (ite (or .cse2 .cse3) 0 .cse4)) (= v_~x$flush_delayed~0_209 0) (= v_~x$w_buff0~0_489 v_~x$w_buff0~0_488) (= v_~x$r_buff1_thd2~0_202 (ite .cse5 v_~x$r_buff1_thd2~0_203 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd2~0_262 256) 0))) (or (and .cse6 .cse7) (and .cse7 .cse8) .cse9)) v_~x$r_buff1_thd2~0_203 0))) (= (ite .cse10 v_~x$w_buff0~0_488 (ite .cse3 v_~x$w_buff1~0_454 (ite .cse5 v_~x$mem_tmp~0_180 v_~__unbuffered_p1_EBX~0_117))) v_~x~0_628) (= (ite .cse11 v_~x~0_630 (ite .cse12 v_~x$w_buff0~0_489 v_~x$w_buff1~0_455)) v_~__unbuffered_p1_EBX~0_117) (= v_~x$r_buff0_thd2~0_262 (ite .cse5 v_~x$r_buff0_thd2~0_263 (ite (or .cse13 .cse9 (and .cse14 .cse6)) v_~x$r_buff0_thd2~0_263 (ite (and .cse15 .cse16) 0 v_~x$r_buff0_thd2~0_263)))) (= v_~weak$$choice2~0_216 |v_P1Thread1of1ForFork1_#t~nondet6#1_38|) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_279) v_~x$r_buff0_thd1~0_278) (= (ite .cse10 0 .cse17) v_~x$w_buff0_used~0_735) (= v_~x$w_buff1~0_455 v_~x$w_buff1~0_454) (= v_~x~0_630 v_~x$mem_tmp~0_180)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_489, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_279, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_38|, ~x$w_buff1~0=v_~x$w_buff1~0_455, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_671, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_292, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_38|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_263, ~x~0=v_~x~0_630, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_737} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_488, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_278, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_117, ~x$flush_delayed~0=v_~x$flush_delayed~0_209, ~x$w_buff1~0=v_~x$w_buff1~0_454, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_669, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_291, ~x$mem_tmp~0=v_~x$mem_tmp~0_180, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_262, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_735, ~weak$$choice0~0=v_~weak$$choice0~0_145, ~weak$$choice2~0=v_~weak$$choice2~0_216, ~x~0=v_~x~0_628} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 00:47:07,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] L812-->L819: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_52 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_59 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_192 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_171 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_192) v_~x$w_buff0_used~0_191) (= v_~x$w_buff1_used~0_170 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_171)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_170 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_58 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_52) v_~x$r_buff1_thd2~0_51) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_59) v_~x$r_buff0_thd2~0_58) (= (ite .cse0 v_~x$w_buff0~0_85 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_156)) v_~x~0_155)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_171, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~x~0=v_~x~0_156, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_170, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~x~0=v_~x~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 00:47:08,069 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:47:08,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1484 [2022-12-13 00:47:08,070 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 703 flow [2022-12-13 00:47:08,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:08,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:08,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:08,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:47:08,070 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:08,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1954573408, now seen corresponding path program 1 times [2022-12-13 00:47:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:08,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014581569] [2022-12-13 00:47:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:08,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:08,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:08,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014581569] [2022-12-13 00:47:08,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014581569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:08,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:08,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:47:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293108766] [2022-12-13 00:47:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:08,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:47:08,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:08,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:47:08,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:47:08,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 00:47:08,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 703 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:08,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:08,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 00:47:08,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:08,600 INFO L130 PetriNetUnfolder]: 220/487 cut-off events. [2022-12-13 00:47:08,600 INFO L131 PetriNetUnfolder]: For 2959/2959 co-relation queries the response was YES. [2022-12-13 00:47:08,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 487 events. 220/487 cut-off events. For 2959/2959 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2643 event pairs, 36 based on Foata normal form. 24/426 useless extension candidates. Maximal degree in co-relation 2196. Up to 279 conditions per place. [2022-12-13 00:47:08,603 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 36 selfloop transitions, 23 changer transitions 13/76 dead transitions. [2022-12-13 00:47:08,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 872 flow [2022-12-13 00:47:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:47:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:47:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-13 00:47:08,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3891625615763547 [2022-12-13 00:47:08,604 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 703 flow. Second operand 7 states and 79 transitions. [2022-12-13 00:47:08,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 872 flow [2022-12-13 00:47:08,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 842 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 00:47:08,610 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 695 flow [2022-12-13 00:47:08,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=695, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2022-12-13 00:47:08,610 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2022-12-13 00:47:08,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:08,610 INFO L89 Accepts]: Start accepts. Operand has 68 places, 57 transitions, 695 flow [2022-12-13 00:47:08,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:08,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:08,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 57 transitions, 695 flow [2022-12-13 00:47:08,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 57 transitions, 695 flow [2022-12-13 00:47:08,631 INFO L130 PetriNetUnfolder]: 28/148 cut-off events. [2022-12-13 00:47:08,631 INFO L131 PetriNetUnfolder]: For 791/825 co-relation queries the response was YES. [2022-12-13 00:47:08,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 148 events. 28/148 cut-off events. For 791/825 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 833 event pairs, 3 based on Foata normal form. 2/113 useless extension candidates. Maximal degree in co-relation 730. Up to 54 conditions per place. [2022-12-13 00:47:08,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 57 transitions, 695 flow [2022-12-13 00:47:08,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-13 00:47:08,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] $Ultimate##0-->L796: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_48| |v_P1Thread1of1ForFork1_~arg#1.offset_48|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~x$w_buff0~0_416 v_~x$w_buff1~0_385) (= v_~x$r_buff0_thd0~0_328 v_~x$r_buff1_thd0~0_325) (= v_~x$r_buff0_thd1~0_218 v_~x$r_buff1_thd1~0_227) (= 2 v_~x$w_buff0~0_415) (= v_~x$w_buff0_used~0_624 v_~x$w_buff1_used~0_561) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_48| |v_P1Thread1of1ForFork1_~arg#1.base_48|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_623 256) 0)) (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= v_~x$w_buff0_used~0_623 1) (= v_~y~0_43 1) (= v_~y~0_43 v_~__unbuffered_p1_EAX~0_91) (= v_~x$r_buff0_thd2~0_242 1) (= v_~x$r_buff0_thd2~0_243 v_~x$r_buff1_thd2~0_192)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_416, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_243, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_415, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_48|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_48|, ~x$w_buff1~0=v_~x$w_buff1~0_385, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_227, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_242, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_325, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_623, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [471] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_332 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_332, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 00:47:09,561 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:47:09,562 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 952 [2022-12-13 00:47:09,562 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 748 flow [2022-12-13 00:47:09,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:09,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:09,563 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:09,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:47:09,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:09,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2138585810, now seen corresponding path program 1 times [2022-12-13 00:47:09,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:09,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33095429] [2022-12-13 00:47:09,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:09,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:10,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33095429] [2022-12-13 00:47:10,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33095429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:10,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:10,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:10,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826799445] [2022-12-13 00:47:10,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:10,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:10,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:10,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:10,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 00:47:10,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 748 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:10,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:10,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 00:47:10,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:10,405 INFO L130 PetriNetUnfolder]: 191/449 cut-off events. [2022-12-13 00:47:10,405 INFO L131 PetriNetUnfolder]: For 2402/2402 co-relation queries the response was YES. [2022-12-13 00:47:10,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 449 events. 191/449 cut-off events. For 2402/2402 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2414 event pairs, 82 based on Foata normal form. 3/373 useless extension candidates. Maximal degree in co-relation 2114. Up to 304 conditions per place. [2022-12-13 00:47:10,410 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 40 selfloop transitions, 25 changer transitions 3/72 dead transitions. [2022-12-13 00:47:10,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 925 flow [2022-12-13 00:47:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:47:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:47:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 00:47:10,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3694581280788177 [2022-12-13 00:47:10,412 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 748 flow. Second operand 7 states and 75 transitions. [2022-12-13 00:47:10,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 925 flow [2022-12-13 00:47:10,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 72 transitions, 885 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 00:47:10,416 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 749 flow [2022-12-13 00:47:10,417 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=749, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2022-12-13 00:47:10,417 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2022-12-13 00:47:10,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:10,417 INFO L89 Accepts]: Start accepts. Operand has 71 places, 57 transitions, 749 flow [2022-12-13 00:47:10,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:10,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:10,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 57 transitions, 749 flow [2022-12-13 00:47:10,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 57 transitions, 749 flow [2022-12-13 00:47:10,444 INFO L130 PetriNetUnfolder]: 24/154 cut-off events. [2022-12-13 00:47:10,445 INFO L131 PetriNetUnfolder]: For 887/934 co-relation queries the response was YES. [2022-12-13 00:47:10,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 154 events. 24/154 cut-off events. For 887/934 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 900 event pairs, 3 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 786. Up to 56 conditions per place. [2022-12-13 00:47:10,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 57 transitions, 749 flow [2022-12-13 00:47:10,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-13 00:47:10,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] $Ultimate##0-->L796: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_48| |v_P1Thread1of1ForFork1_~arg#1.offset_48|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~x$w_buff0~0_416 v_~x$w_buff1~0_385) (= v_~x$r_buff0_thd0~0_328 v_~x$r_buff1_thd0~0_325) (= v_~x$r_buff0_thd1~0_218 v_~x$r_buff1_thd1~0_227) (= 2 v_~x$w_buff0~0_415) (= v_~x$w_buff0_used~0_624 v_~x$w_buff1_used~0_561) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_48| |v_P1Thread1of1ForFork1_~arg#1.base_48|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_623 256) 0)) (not (= (mod v_~x$w_buff1_used~0_561 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= v_~x$w_buff0_used~0_623 1) (= v_~y~0_43 1) (= v_~y~0_43 v_~__unbuffered_p1_EAX~0_91) (= v_~x$r_buff0_thd2~0_242 1) (= v_~x$r_buff0_thd2~0_243 v_~x$r_buff1_thd2~0_192)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_416, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_243, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_415, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_48|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_48|, ~x$w_buff1~0=v_~x$w_buff1~0_385, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_227, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_242, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_325, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_623, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:47:10,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [499] $Ultimate##0-->L850: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_781 256) 0))) (.cse0 (= 0 (mod v_~x$w_buff0_used~0_783 256))) (.cse1 (not (= (mod v_~x$r_buff0_thd0~0_420 256) 0)))) (let ((.cse3 (and (not .cse0) .cse1)) (.cse4 (and .cse1 .cse2))) (and (= 2 v_~x$w_buff0~0_524) (= v_~x$r_buff0_thd2~0_287 v_~x$r_buff1_thd2~0_224) (= v_~y~0_55 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_60| |v_P1Thread1of1ForFork1_~arg#1.base_60|) (= (ite .cse0 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66| 0)) (= v_~x$r_buff1_thd0~0_416 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_713 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$r_buff0_thd0~0_419 256) 0)))) 0 v_~x$r_buff0_thd0~0_420)) (= (ite .cse1 v_~x$w_buff0~0_524 (ite .cse3 v_~x$w_buff1~0_488 v_~x~0_673)) v_~x~0_672) (= v_~x$r_buff0_thd0~0_419 (ite .cse4 0 v_~x$r_buff0_thd0~0_420)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66|) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff0_used~0_783) v_~x$w_buff1_used~0_713) (= v_~x$r_buff0_thd1~0_304 v_~x$r_buff1_thd1~0_317) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_60| |v_P1Thread1of1ForFork1_~arg#1.offset_60|) (= v_~x$w_buff0_used~0_781 (ite .cse1 0 1)) (= v_~y~0_55 v_~__unbuffered_p1_EAX~0_111) (= v_~x$r_buff0_thd2~0_286 1) (= v_~x$w_buff0~0_525 v_~x$w_buff1~0_488)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_525, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_60|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_420, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_304, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_287, ~x~0=v_~x~0_673, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_783, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_60|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_524, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_304, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_60|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_60|, ~x$w_buff1~0=v_~x$w_buff1~0_488, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_713, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_224, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_317, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_416, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_286, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_781, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_60|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_60|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66|, ~y~0=v_~y~0_55, ~x~0=v_~x~0_672} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0] and [471] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_332 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_332, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 00:47:10,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [363] L796-->L812: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_63 256) 0))) (let ((.cse10 (not .cse9)) (.cse1 (and .cse9 .cse8)) (.cse2 (and (= (mod v_~x$w_buff1_used~0_181 256) 0) .cse9)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse4 (or .cse1 .cse2 .cse11)) (.cse5 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_52 v_~__unbuffered_p1_EBX~0_22) v_~x~0_163) (= v_~x$w_buff0~0_96 v_~x$w_buff0~0_95) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_19) (= v_~x$mem_tmp~0_52 v_~x~0_165) (= (ite .cse0 v_~x$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_181 0)) v_~x$w_buff1_used~0_180) (= v_~x$w_buff1~0_97 v_~x$w_buff1~0_96) (= v_~x$w_buff0_used~0_203 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~x$r_buff1_thd2~0_56 0))) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse4 v_~x~0_165 (ite .cse5 v_~x$w_buff0~0_96 v_~x$w_buff1~0_97))) (= v_~x$r_buff0_thd2~0_62 (ite .cse0 v_~x$r_buff0_thd2~0_63 (ite (or .cse1 .cse3 (and .cse7 .cse9)) v_~x$r_buff0_thd2~0_63 (ite (and (not .cse3) .cse10) 0 v_~x$r_buff0_thd2~0_63)))) (= v_~x$flush_delayed~0_81 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_181, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_165, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~x$flush_delayed~0=v_~x$flush_delayed~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] and [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-13 00:47:11,435 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:47:11,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1018 [2022-12-13 00:47:11,435 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 739 flow [2022-12-13 00:47:11,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:11,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:11,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:11,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:47:11,436 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:11,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2141151680, now seen corresponding path program 2 times [2022-12-13 00:47:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:11,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93618854] [2022-12-13 00:47:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:11,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:11,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93618854] [2022-12-13 00:47:11,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93618854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:11,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:11,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919288796] [2022-12-13 00:47:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:11,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:11,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:47:11,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:11,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:11,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:47:11,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:11,995 INFO L130 PetriNetUnfolder]: 215/546 cut-off events. [2022-12-13 00:47:11,995 INFO L131 PetriNetUnfolder]: For 2699/2699 co-relation queries the response was YES. [2022-12-13 00:47:11,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 546 events. 215/546 cut-off events. For 2699/2699 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3337 event pairs, 72 based on Foata normal form. 21/458 useless extension candidates. Maximal degree in co-relation 2413. Up to 311 conditions per place. [2022-12-13 00:47:11,998 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 31 selfloop transitions, 18 changer transitions 21/73 dead transitions. [2022-12-13 00:47:11,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 966 flow [2022-12-13 00:47:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:47:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:47:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-13 00:47:11,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2022-12-13 00:47:11,999 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 739 flow. Second operand 7 states and 82 transitions. [2022-12-13 00:47:11,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 966 flow [2022-12-13 00:47:12,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 917 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 00:47:12,004 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 627 flow [2022-12-13 00:47:12,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=627, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2022-12-13 00:47:12,005 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2022-12-13 00:47:12,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:12,005 INFO L89 Accepts]: Start accepts. Operand has 72 places, 46 transitions, 627 flow [2022-12-13 00:47:12,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:12,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:12,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 46 transitions, 627 flow [2022-12-13 00:47:12,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 46 transitions, 627 flow [2022-12-13 00:47:12,022 INFO L130 PetriNetUnfolder]: 20/124 cut-off events. [2022-12-13 00:47:12,022 INFO L131 PetriNetUnfolder]: For 759/771 co-relation queries the response was YES. [2022-12-13 00:47:12,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 124 events. 20/124 cut-off events. For 759/771 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 690 event pairs, 3 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 666. Up to 46 conditions per place. [2022-12-13 00:47:12,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 46 transitions, 627 flow [2022-12-13 00:47:12,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-13 00:47:12,024 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:12,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 00:47:12,024 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 627 flow [2022-12-13 00:47:12,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:12,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:12,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:12,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 00:47:12,025 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2138581501, now seen corresponding path program 1 times [2022-12-13 00:47:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:12,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612878081] [2022-12-13 00:47:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:12,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612878081] [2022-12-13 00:47:12,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612878081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:12,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:12,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:12,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992589459] [2022-12-13 00:47:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:12,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:12,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:12,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-13 00:47:12,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 627 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:12,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:12,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-13 00:47:12,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:12,528 INFO L130 PetriNetUnfolder]: 151/355 cut-off events. [2022-12-13 00:47:12,528 INFO L131 PetriNetUnfolder]: For 2248/2248 co-relation queries the response was YES. [2022-12-13 00:47:12,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1738 conditions, 355 events. 151/355 cut-off events. For 2248/2248 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1794 event pairs, 85 based on Foata normal form. 18/313 useless extension candidates. Maximal degree in co-relation 1709. Up to 232 conditions per place. [2022-12-13 00:47:12,530 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 24 selfloop transitions, 16 changer transitions 12/55 dead transitions. [2022-12-13 00:47:12,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 55 transitions, 759 flow [2022-12-13 00:47:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:47:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:47:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-13 00:47:12,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-13 00:47:12,532 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 627 flow. Second operand 6 states and 57 transitions. [2022-12-13 00:47:12,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 55 transitions, 759 flow [2022-12-13 00:47:12,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 645 flow, removed 6 selfloop flow, removed 11 redundant places. [2022-12-13 00:47:12,536 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 470 flow [2022-12-13 00:47:12,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2022-12-13 00:47:12,536 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2022-12-13 00:47:12,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:12,536 INFO L89 Accepts]: Start accepts. Operand has 63 places, 41 transitions, 470 flow [2022-12-13 00:47:12,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:12,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:12,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 41 transitions, 470 flow [2022-12-13 00:47:12,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 41 transitions, 470 flow [2022-12-13 00:47:12,547 INFO L130 PetriNetUnfolder]: 19/97 cut-off events. [2022-12-13 00:47:12,547 INFO L131 PetriNetUnfolder]: For 407/409 co-relation queries the response was YES. [2022-12-13 00:47:12,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 97 events. 19/97 cut-off events. For 407/409 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 467 event pairs, 3 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 483. Up to 39 conditions per place. [2022-12-13 00:47:12,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 41 transitions, 470 flow [2022-12-13 00:47:12,548 INFO L226 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-13 00:47:12,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] $Ultimate##0-->L796: Formula: (and (= v_~y~0_45 v_~__unbuffered_p1_EAX~0_93) (= v_~x$r_buff0_thd2~0_247 v_~x$r_buff1_thd2~0_194) (= v_~x~0_586 1) (= v_~x$r_buff0_thd2~0_246 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_50| |v_P1Thread1of1ForFork1_~arg#1.offset_50|) (= v_~x$w_buff0~0_446 v_~x$w_buff1~0_413) (= v_~x$r_buff0_thd1~0_244 v_~x$r_buff1_thd1~0_253) (= v_~x$r_buff0_thd0~0_371 v_~x$r_buff1_thd0~0_368) (= v_P0Thread1of1ForFork0_~arg.offset_36 |v_P0Thread1of1ForFork0_#in~arg.offset_36|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_679 256) 0)) (not (= (mod v_~x$w_buff1_used~0_615 256) 0)))) 1 0)) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| 0)) (= 2 v_~x$w_buff0~0_445) (= v_~y~0_45 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_50| |v_P1Thread1of1ForFork1_~arg#1.base_50|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|) (= v_~x$w_buff0_used~0_680 v_~x$w_buff1_used~0_615) (= v_P0Thread1of1ForFork0_~arg.base_36 |v_P0Thread1of1ForFork0_#in~arg.base_36|) (= v_~x$w_buff0_used~0_679 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_446, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_50|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_371, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_244, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_36|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_36|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_680, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_50|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_445, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_371, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_244, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_50|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_50|, ~x$w_buff1~0=v_~x$w_buff1~0_413, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_36|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_194, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_615, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_253, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_246, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_368, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_36, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_679, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_50|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_50|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_36|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|, ~y~0=v_~y~0_45, ~x~0=v_~x~0_586, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_36} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [352] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_66 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd1~0_68 256))))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_151 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd1~0_67 (ite .cse0 0 v_~x$r_buff0_thd1~0_68)) (= v_~x$r_buff1_thd1~0_65 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_67 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_150 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_66)) (= v_~x$w_buff1_used~0_150 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_151)) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172)) (= (ite .cse4 v_~x$w_buff0~0_71 (ite .cse3 v_~x$w_buff1~0_74 v_~x~0_128)) v_~x~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_66, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_65, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:47:12,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:47:12,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-13 00:47:12,753 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 478 flow [2022-12-13 00:47:12,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:12,753 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:12,753 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:12,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 00:47:12,754 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2136738768, now seen corresponding path program 2 times [2022-12-13 00:47:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:12,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240147705] [2022-12-13 00:47:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:13,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240147705] [2022-12-13 00:47:13,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240147705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:13,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:13,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472988089] [2022-12-13 00:47:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:13,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:13,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:13,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:13,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 00:47:13,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 478 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:13,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:13,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 00:47:13,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:13,526 INFO L130 PetriNetUnfolder]: 138/302 cut-off events. [2022-12-13 00:47:13,527 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2022-12-13 00:47:13,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 302 events. 138/302 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1364 event pairs, 53 based on Foata normal form. 12/265 useless extension candidates. Maximal degree in co-relation 1394. Up to 208 conditions per place. [2022-12-13 00:47:13,529 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 27 selfloop transitions, 13 changer transitions 13/56 dead transitions. [2022-12-13 00:47:13,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 641 flow [2022-12-13 00:47:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:47:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:47:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-12-13 00:47:13,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2022-12-13 00:47:13,530 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 478 flow. Second operand 8 states and 67 transitions. [2022-12-13 00:47:13,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 641 flow [2022-12-13 00:47:13,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 585 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 00:47:13,533 INFO L231 Difference]: Finished difference. Result has 63 places, 37 transitions, 400 flow [2022-12-13 00:47:13,533 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=400, PETRI_PLACES=63, PETRI_TRANSITIONS=37} [2022-12-13 00:47:13,533 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2022-12-13 00:47:13,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:13,533 INFO L89 Accepts]: Start accepts. Operand has 63 places, 37 transitions, 400 flow [2022-12-13 00:47:13,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:13,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:13,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 37 transitions, 400 flow [2022-12-13 00:47:13,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 37 transitions, 400 flow [2022-12-13 00:47:13,543 INFO L130 PetriNetUnfolder]: 19/92 cut-off events. [2022-12-13 00:47:13,543 INFO L131 PetriNetUnfolder]: For 365/376 co-relation queries the response was YES. [2022-12-13 00:47:13,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 92 events. 19/92 cut-off events. For 365/376 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 429 event pairs, 8 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 426. Up to 34 conditions per place. [2022-12-13 00:47:13,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 37 transitions, 400 flow [2022-12-13 00:47:13,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-13 00:47:14,594 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:47:14,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1062 [2022-12-13 00:47:14,595 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 436 flow [2022-12-13 00:47:14,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:14,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:14,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:14,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 00:47:14,595 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:47:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1954959730, now seen corresponding path program 1 times [2022-12-13 00:47:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:14,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442254539] [2022-12-13 00:47:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442254539] [2022-12-13 00:47:14,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442254539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:14,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:14,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:47:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738008628] [2022-12-13 00:47:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:14,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:47:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:14,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:47:14,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:47:14,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-13 00:47:14,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:14,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:14,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-13 00:47:14,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:15,033 INFO L130 PetriNetUnfolder]: 175/397 cut-off events. [2022-12-13 00:47:15,033 INFO L131 PetriNetUnfolder]: For 1522/1522 co-relation queries the response was YES. [2022-12-13 00:47:15,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 397 events. 175/397 cut-off events. For 1522/1522 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2086 event pairs, 49 based on Foata normal form. 20/342 useless extension candidates. Maximal degree in co-relation 1548. Up to 173 conditions per place. [2022-12-13 00:47:15,035 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 18 selfloop transitions, 9 changer transitions 22/52 dead transitions. [2022-12-13 00:47:15,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 562 flow [2022-12-13 00:47:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:47:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:47:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-13 00:47:15,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2022-12-13 00:47:15,036 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 436 flow. Second operand 7 states and 64 transitions. [2022-12-13 00:47:15,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 562 flow [2022-12-13 00:47:15,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 486 flow, removed 11 selfloop flow, removed 9 redundant places. [2022-12-13 00:47:15,039 INFO L231 Difference]: Finished difference. Result has 60 places, 25 transitions, 219 flow [2022-12-13 00:47:15,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=60, PETRI_TRANSITIONS=25} [2022-12-13 00:47:15,039 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2022-12-13 00:47:15,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:15,039 INFO L89 Accepts]: Start accepts. Operand has 60 places, 25 transitions, 219 flow [2022-12-13 00:47:15,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:15,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:15,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 25 transitions, 219 flow [2022-12-13 00:47:15,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 25 transitions, 219 flow [2022-12-13 00:47:15,046 INFO L130 PetriNetUnfolder]: 6/52 cut-off events. [2022-12-13 00:47:15,046 INFO L131 PetriNetUnfolder]: For 203/204 co-relation queries the response was YES. [2022-12-13 00:47:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 52 events. 6/52 cut-off events. For 203/204 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 182 event pairs, 2 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 224. Up to 16 conditions per place. [2022-12-13 00:47:15,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 25 transitions, 219 flow [2022-12-13 00:47:15,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 124