/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:43:35,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:43:35,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:43:35,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:43:35,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:43:35,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:43:35,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:43:35,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:43:35,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:43:35,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:43:35,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:43:35,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:43:35,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:43:35,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:43:35,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:43:35,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:43:35,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:43:35,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:43:35,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:43:35,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:43:35,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:43:35,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:43:35,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:43:35,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:43:35,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:43:35,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:43:35,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:43:35,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:43:35,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:43:35,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:43:35,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:43:35,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:43:35,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:43:35,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:43:35,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:43:35,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:43:35,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:43:35,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:43:35,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:43:35,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:43:35,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:43:35,656 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:43:35,682 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:43:35,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:43:35,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:43:35,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:43:35,684 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:43:35,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:43:35,685 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:43:35,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:43:35,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:43:35,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:43:35,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:43:35,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:43:35,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:43:35,686 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:43:35,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:43:35,686 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:43:35,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:43:35,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:43:35,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:43:35,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:43:35,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:43:35,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:43:35,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:43:35,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:43:35,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:43:35,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:43:35,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:43:35,688 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:43:35,688 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:43:35,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:43:35,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:43:35,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:43:35,999 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:43:36,000 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:43:36,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2022-12-06 06:43:37,000 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:43:37,259 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:43:37,260 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2022-12-06 06:43:37,275 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6357fb36e/e808ac6d9503423fbcf33a1e7e0c5269/FLAG577dc5f96 [2022-12-06 06:43:37,296 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6357fb36e/e808ac6d9503423fbcf33a1e7e0c5269 [2022-12-06 06:43:37,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:43:37,299 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:43:37,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:43:37,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:43:37,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:43:37,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7003910d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37, skipping insertion in model container [2022-12-06 06:43:37,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:43:37,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:43:37,490 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/safe027_power.opt.i[994,1007] [2022-12-06 06:43:37,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:43:37,709 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:43:37,717 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/safe027_power.opt.i[994,1007] [2022-12-06 06:43:37,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:43:37,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:43:37,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:43:37,784 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:43:37,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37 WrapperNode [2022-12-06 06:43:37,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:43:37,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:43:37,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:43:37,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:43:37,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,859 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-12-06 06:43:37,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:43:37,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:43:37,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:43:37,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:43:37,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:43:37,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:43:37,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:43:37,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:43:37,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (1/1) ... [2022-12-06 06:43:37,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:43:37,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:43:37,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:43:37,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:43:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:43:37,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:43:37,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:43:37,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:43:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:43:37,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:43:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:43:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:43:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:43:37,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:43:37,976 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:43:38,152 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:43:38,157 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:43:38,606 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:43:38,932 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:43:38,933 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:43:38,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:43:38 BoogieIcfgContainer [2022-12-06 06:43:38,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:43:38,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:43:38,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:43:38,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:43:38,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:43:37" (1/3) ... [2022-12-06 06:43:38,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e83ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:43:38, skipping insertion in model container [2022-12-06 06:43:38,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:37" (2/3) ... [2022-12-06 06:43:38,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e83ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:43:38, skipping insertion in model container [2022-12-06 06:43:38,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:43:38" (3/3) ... [2022-12-06 06:43:38,942 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2022-12-06 06:43:38,956 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:43:38,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:43:38,958 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:43:39,013 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:43:39,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2022-12-06 06:43:39,099 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-06 06:43:39,099 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:43:39,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-06 06:43:39,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2022-12-06 06:43:39,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2022-12-06 06:43:39,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:39,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2022-12-06 06:43:39,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2022-12-06 06:43:39,164 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-06 06:43:39,164 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:43:39,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-06 06:43:39,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2022-12-06 06:43:39,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 2664 [2022-12-06 06:43:59,704 INFO L203 LiptonReduction]: Total number of compositions: 116 [2022-12-06 06:43:59,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:43:59,725 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;@5322cd11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:43:59,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:43:59,728 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:43:59,728 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:43:59,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:59,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:43:59,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:43:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash 919699773, now seen corresponding path program 1 times [2022-12-06 06:43:59,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:59,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401927344] [2022-12-06 06:43:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:00,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:00,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401927344] [2022-12-06 06:44:00,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401927344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:00,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:00,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:44:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157808765] [2022-12-06 06:44:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:00,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:44:00,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:44:00,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:44:00,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 06:44:00,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:00,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:00,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 06:44:00,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:01,149 INFO L130 PetriNetUnfolder]: 4863/6652 cut-off events. [2022-12-06 06:44:01,149 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 06:44:01,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13476 conditions, 6652 events. 4863/6652 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 31578 event pairs, 1320 based on Foata normal form. 0/6052 useless extension candidates. Maximal degree in co-relation 13464. Up to 5308 conditions per place. [2022-12-06 06:44:01,184 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 37 selfloop transitions, 2 changer transitions 8/48 dead transitions. [2022-12-06 06:44:01,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 208 flow [2022-12-06 06:44:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:44:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:44:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 06:44:01,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2022-12-06 06:44:01,194 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 55 transitions. [2022-12-06 06:44:01,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 208 flow [2022-12-06 06:44:01,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:44:01,199 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 60 flow [2022-12-06 06:44:01,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-06 06:44:01,205 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 06:44:01,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:01,206 INFO L89 Accepts]: Start accepts. Operand has 39 places, 24 transitions, 60 flow [2022-12-06 06:44:01,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:01,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:01,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 60 flow [2022-12-06 06:44:01,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 60 flow [2022-12-06 06:44:01,222 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 06:44:01,222 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:01,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:44:01,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 60 flow [2022-12-06 06:44:01,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 06:44:01,443 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:01,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 06:44:01,444 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 60 flow [2022-12-06 06:44:01,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:01,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:01,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:01,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:44:01,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:01,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1759807304, now seen corresponding path program 1 times [2022-12-06 06:44:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:01,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71635726] [2022-12-06 06:44:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:01,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:01,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71635726] [2022-12-06 06:44:01,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71635726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:01,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:01,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:44:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620318693] [2022-12-06 06:44:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:01,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:44:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:01,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:44:01,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:44:01,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:44:01,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:01,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:01,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:44:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:02,265 INFO L130 PetriNetUnfolder]: 2951/4084 cut-off events. [2022-12-06 06:44:02,265 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-12-06 06:44:02,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8618 conditions, 4084 events. 2951/4084 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19575 event pairs, 551 based on Foata normal form. 64/4144 useless extension candidates. Maximal degree in co-relation 8608. Up to 3423 conditions per place. [2022-12-06 06:44:02,286 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 38 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-06 06:44:02,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 182 flow [2022-12-06 06:44:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:44:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:44:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 06:44:02,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 06:44:02,288 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 60 flow. Second operand 3 states and 44 transitions. [2022-12-06 06:44:02,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 182 flow [2022-12-06 06:44:02,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:02,290 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 64 flow [2022-12-06 06:44:02,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2022-12-06 06:44:02,290 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2022-12-06 06:44:02,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:02,290 INFO L89 Accepts]: Start accepts. Operand has 36 places, 24 transitions, 64 flow [2022-12-06 06:44:02,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:02,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:02,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 64 flow [2022-12-06 06:44:02,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 64 flow [2022-12-06 06:44:02,297 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 06:44:02,297 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:02,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:44:02,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 64 flow [2022-12-06 06:44:02,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 06:44:02,309 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:02,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:44:02,311 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 64 flow [2022-12-06 06:44:02,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:02,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:02,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:02,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:44:02,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1280548578, now seen corresponding path program 1 times [2022-12-06 06:44:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:02,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349024339] [2022-12-06 06:44:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:02,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349024339] [2022-12-06 06:44:02,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349024339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:02,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:02,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:44:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728248279] [2022-12-06 06:44:02,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:02,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:44:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:02,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:44:02,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:44:02,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:44:02,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 64 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:02,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:02,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:44:02,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:03,575 INFO L130 PetriNetUnfolder]: 4927/6808 cut-off events. [2022-12-06 06:44:03,576 INFO L131 PetriNetUnfolder]: For 589/589 co-relation queries the response was YES. [2022-12-06 06:44:03,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14583 conditions, 6808 events. 4927/6808 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 31081 event pairs, 1015 based on Foata normal form. 240/7048 useless extension candidates. Maximal degree in co-relation 14572. Up to 2797 conditions per place. [2022-12-06 06:44:03,598 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 41 selfloop transitions, 3 changer transitions 5/49 dead transitions. [2022-12-06 06:44:03,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 215 flow [2022-12-06 06:44:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:44:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:44:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:44:03,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-06 06:44:03,602 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 64 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:44:03,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 215 flow [2022-12-06 06:44:03,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:03,604 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 74 flow [2022-12-06 06:44:03,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-06 06:44:03,605 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 06:44:03,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:03,605 INFO L89 Accepts]: Start accepts. Operand has 39 places, 24 transitions, 74 flow [2022-12-06 06:44:03,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:03,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:03,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 74 flow [2022-12-06 06:44:03,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 74 flow [2022-12-06 06:44:03,613 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 06:44:03,613 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 06:44:03,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 24 events. 0/24 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:44:03,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 74 flow [2022-12-06 06:44:03,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 06:44:03,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [818] $Ultimate##0-->L860: Formula: (and (= v_~y~0_5 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_5, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [896] $Ultimate##0-->L769: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_5| v_P0Thread1of1ForFork3_~arg.offset_5) (= v_P0Thread1of1ForFork3_~arg.base_5 |v_P0Thread1of1ForFork3_#in~arg.base_5|) (= v_~y~0_19 v_~__unbuffered_p0_EAX~0_24)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_19, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_5, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_5, ~y~0=v_~y~0_19, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset] [2022-12-06 06:44:03,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:03,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:44:03,654 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 72 flow [2022-12-06 06:44:03,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:03,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:03,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:03,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:44:03,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:03,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1280547214, now seen corresponding path program 1 times [2022-12-06 06:44:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:03,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344977855] [2022-12-06 06:44:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:03,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344977855] [2022-12-06 06:44:03,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344977855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:03,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:03,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:44:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471078027] [2022-12-06 06:44:03,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:03,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:44:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:03,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:44:03,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:44:03,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 06:44:03,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:03,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:03,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 06:44:03,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:04,176 INFO L130 PetriNetUnfolder]: 1536/2295 cut-off events. [2022-12-06 06:44:04,176 INFO L131 PetriNetUnfolder]: For 1092/1092 co-relation queries the response was YES. [2022-12-06 06:44:04,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5077 conditions, 2295 events. 1536/2295 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10809 event pairs, 291 based on Foata normal form. 36/2331 useless extension candidates. Maximal degree in co-relation 5064. Up to 1810 conditions per place. [2022-12-06 06:44:04,186 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-06 06:44:04,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 174 flow [2022-12-06 06:44:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:44:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:44:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:44:04,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2022-12-06 06:44:04,187 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 72 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:44:04,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 174 flow [2022-12-06 06:44:04,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 154 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 06:44:04,190 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 66 flow [2022-12-06 06:44:04,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 06:44:04,190 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2022-12-06 06:44:04,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:04,190 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 66 flow [2022-12-06 06:44:04,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:04,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:04,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 66 flow [2022-12-06 06:44:04,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 66 flow [2022-12-06 06:44:04,196 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:44:04,196 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:44:04,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:44:04,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 66 flow [2022-12-06 06:44:04,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:44:04,243 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:04,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 06:44:04,244 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 66 flow [2022-12-06 06:44:04,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:04,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:04,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:04,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:44:04,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1017004036, now seen corresponding path program 1 times [2022-12-06 06:44:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:04,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544816680] [2022-12-06 06:44:04,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:05,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:05,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544816680] [2022-12-06 06:44:05,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544816680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:05,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:05,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:44:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653444278] [2022-12-06 06:44:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:05,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:44:05,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:05,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:44:05,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:44:05,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 06:44:05,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:05,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:05,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 06:44:05,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:05,851 INFO L130 PetriNetUnfolder]: 2025/2880 cut-off events. [2022-12-06 06:44:05,851 INFO L131 PetriNetUnfolder]: For 571/571 co-relation queries the response was YES. [2022-12-06 06:44:05,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6390 conditions, 2880 events. 2025/2880 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14156 event pairs, 162 based on Foata normal form. 54/2934 useless extension candidates. Maximal degree in co-relation 6379. Up to 1953 conditions per place. [2022-12-06 06:44:05,864 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 50 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2022-12-06 06:44:05,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 287 flow [2022-12-06 06:44:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 06:44:05,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.591304347826087 [2022-12-06 06:44:05,866 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 66 flow. Second operand 5 states and 68 transitions. [2022-12-06 06:44:05,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 287 flow [2022-12-06 06:44:05,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:05,868 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 137 flow [2022-12-06 06:44:05,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-06 06:44:05,869 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-06 06:44:05,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:05,869 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 137 flow [2022-12-06 06:44:05,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:05,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:05,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 137 flow [2022-12-06 06:44:05,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 137 flow [2022-12-06 06:44:05,927 INFO L130 PetriNetUnfolder]: 240/422 cut-off events. [2022-12-06 06:44:05,928 INFO L131 PetriNetUnfolder]: For 147/152 co-relation queries the response was YES. [2022-12-06 06:44:05,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 422 events. 240/422 cut-off events. For 147/152 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1926 event pairs, 142 based on Foata normal form. 1/403 useless extension candidates. Maximal degree in co-relation 978. Up to 339 conditions per place. [2022-12-06 06:44:05,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 137 flow [2022-12-06 06:44:05,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 06:44:06,115 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [919] $Ultimate##0-->L807: Formula: (and (= v_~x$w_buff0_used~0_436 v_~x$w_buff1_used~0_424) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff0_thd3~0_155 v_~x$r_buff1_thd3~0_159) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~x$r_buff1_thd2~0_88 v_~x$r_buff0_thd2~0_110) (= v_~x$r_buff1_thd4~0_74 v_~x$r_buff0_thd4~0_80) (= v_~x$w_buff0_used~0_435 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_435 256) 0)) (not (= (mod v_~x$w_buff1_used~0_424 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_117 v_~x$r_buff1_thd0~0_119) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_215) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_109 1) (= v_~x$r_buff1_thd1~0_94 v_~x$r_buff0_thd1~0_93)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_436, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_215, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_424, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_74, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_435, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [785] L843-->L850: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_88 256) 0))) (let ((.cse8 (= (mod v_~x$w_buff0_used~0_255 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_245 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd3~0_86 256) 0)) (.cse5 (not .cse7)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_254 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse3 (select |v_#memory_int_234| |v_~#x~0.base_160|)) (.cse0 (not .cse10)) (.cse1 (not .cse9)) (.cse6 (not .cse8))) (and (= v_~x$w_buff1_used~0_244 (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_245)) (= (store |v_#memory_int_234| |v_~#x~0.base_160| (store .cse3 |v_~#x~0.offset_160| |v_P2_#t~ite32_29|)) |v_#memory_int_233|) (= v_~x$r_buff0_thd3~0_87 (ite .cse2 0 v_~x$r_buff0_thd3~0_88)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_244 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_87 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_86) v_~x$r_buff1_thd3~0_85) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_255) v_~x$w_buff0_used~0_254) (let ((.cse11 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork2_#t~mem30_1|))) (or (and (or .cse7 .cse8) (or (and (= (select .cse3 |v_~#x~0.offset_160|) |v_P2_#t~mem30_30|) (= |v_P2_#t~ite31_29| |v_P2_#t~mem30_30|) (or .cse9 .cse10)) (and (= |v_P2_#t~ite31_29| v_~x$w_buff1~0_104) .cse11 .cse0 .cse1)) (= |v_P2_#t~ite31_29| |v_P2_#t~ite32_29|)) (and .cse5 .cse11 .cse6 (= |v_P2Thread1of1ForFork2_#t~ite31_1| |v_P2_#t~ite31_29|) (= |v_P2_#t~ite32_29| v_~x$w_buff0~0_91)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_1|, ~#x~0.offset=|v_~#x~0.offset_160|, ~x$w_buff1~0=v_~x$w_buff1~0_104, #memory_int=|v_#memory_int_234|, ~#x~0.base=|v_~#x~0.base_160|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_86, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_88, P2Thread1of1ForFork2_#t~mem30=|v_P2Thread1of1ForFork2_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_255} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_91, ~#x~0.offset=|v_~#x~0.offset_160|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_104, #memory_int=|v_#memory_int_233|, ~#x~0.base=|v_~#x~0.base_160|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_244, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} AuxVars[|v_P2_#t~ite31_29|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite32, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~mem30, ~x$w_buff0_used~0] [2022-12-06 06:44:06,942 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [919] $Ultimate##0-->L807: Formula: (and (= v_~x$w_buff0_used~0_436 v_~x$w_buff1_used~0_424) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff0_thd3~0_155 v_~x$r_buff1_thd3~0_159) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~x$r_buff1_thd2~0_88 v_~x$r_buff0_thd2~0_110) (= v_~x$r_buff1_thd4~0_74 v_~x$r_buff0_thd4~0_80) (= v_~x$w_buff0_used~0_435 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_435 256) 0)) (not (= (mod v_~x$w_buff1_used~0_424 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_117 v_~x$r_buff1_thd0~0_119) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_215) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_109 1) (= v_~x$r_buff1_thd1~0_94 v_~x$r_buff0_thd1~0_93)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_436, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_215, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_424, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_74, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_435, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [771] L769-->L785: Formula: (let ((.cse15 (= (mod v_~x$w_buff1_used~0_279 256) 0)) (.cse4 (= (mod v_~x$r_buff1_thd1~0_59 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_287 256) 0)) (.cse11 (= (mod v_~x$r_buff0_thd1~0_60 256) 0))) (let ((.cse12 (not .cse11)) (.cse14 (not .cse16)) (.cse9 (and .cse4 .cse11)) (.cse10 (and .cse15 .cse11)) (.cse13 (select |v_#memory_int_276| |v_~#x~0.base_192|)) (.cse7 (= (mod v_~weak$$choice2~0_92 256) 0))) (let ((.cse0 (not .cse7)) (.cse3 (= (mod v_~x$w_buff1_used~0_278 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_286 256) 0)) (.cse8 (select .cse13 |v_~#x~0.offset_192|)) (.cse5 (or .cse9 .cse16 .cse10)) (.cse6 (and .cse12 .cse14))) (and (= v_~x$flush_delayed~0_66 0) (= v_~x$r_buff1_thd1~0_58 (ite .cse0 v_~x$r_buff1_thd1~0_59 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_59 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~x$r_buff1_thd1~0_59 0))) (= (ite .cse0 v_~x$w_buff0_used~0_287 (ite .cse5 v_~x$w_buff0_used~0_287 (ite .cse6 0 v_~x$w_buff0_used~0_287))) v_~x$w_buff0_used~0_286) (or (and (= v_~__unbuffered_p0_EBX~0_24 |v_P0_#t~mem9_32|) (= |v_P0_#t~ite10_29| |v_P0_#t~mem9_32|) .cse7) (and (= |v_P0Thread1of1ForFork3_#t~mem9_1| |v_P0_#t~mem9_32|) (= |v_P0_#t~ite10_29| v_~x$mem_tmp~0_38) .cse0)) (= v_~x$w_buff0~0_122 v_~x$w_buff0~0_121) (= v_~weak$$choice0~0_86 |v_P0Thread1of1ForFork3_#t~nondet3_1|) (= v_~weak$$choice2~0_92 |v_P0Thread1of1ForFork3_#t~nondet4_1|) (= .cse8 v_~x$mem_tmp~0_38) (= (ite .cse0 v_~x$w_buff1_used~0_279 (ite (or .cse1 .cse9 .cse10) v_~x$w_buff1_used~0_279 0)) v_~x$w_buff1_used~0_278) (= v_~x$w_buff1~0_135 v_~x$w_buff1~0_134) (= v_~x$r_buff0_thd1~0_59 (ite .cse0 v_~x$r_buff0_thd1~0_60 (ite (or .cse1 .cse9 (and .cse11 .cse3)) v_~x$r_buff0_thd1~0_60 (ite (and .cse12 (not .cse1)) 0 v_~x$r_buff0_thd1~0_60)))) (= (store |v_#memory_int_276| |v_~#x~0.base_192| (store .cse13 |v_~#x~0.offset_192| |v_P0_#t~ite10_29|)) |v_#memory_int_275|) (or (and (= v_~__unbuffered_p0_EBX~0_24 |v_P0_#t~mem6_28|) (= .cse8 |v_P0_#t~mem6_28|) .cse5) (and (= v_~__unbuffered_p0_EBX~0_24 (ite .cse6 v_~x$w_buff0~0_122 v_~x$w_buff1~0_135)) .cse14 (or .cse12 (not .cse4)) (or .cse12 (not .cse15)) (= |v_P0Thread1of1ForFork3_#t~mem6_1| |v_P0_#t~mem6_28|))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_122, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_60, ~#x~0.offset=|v_~#x~0.offset_192|, ~x$w_buff1~0=v_~x$w_buff1~0_135, P0Thread1of1ForFork3_#t~mem9=|v_P0Thread1of1ForFork3_#t~mem9_1|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_279, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, P0Thread1of1ForFork3_#t~mem6=|v_P0Thread1of1ForFork3_#t~mem6_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_287, #memory_int=|v_#memory_int_276|, ~#x~0.base=|v_~#x~0.base_192|, P0Thread1of1ForFork3_#t~nondet3=|v_P0Thread1of1ForFork3_#t~nondet3_1|, P0Thread1of1ForFork3_#t~nondet4=|v_P0Thread1of1ForFork3_#t~nondet4_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ~#x~0.offset=|v_~#x~0.offset_192|, ~x$w_buff1~0=v_~x$w_buff1~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_278, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, P0Thread1of1ForFork3_#t~mem8=|v_P0Thread1of1ForFork3_#t~mem8_1|, P0Thread1of1ForFork3_#t~mem5=|v_P0Thread1of1ForFork3_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_286, ~weak$$choice0~0=v_~weak$$choice0~0_86, P0Thread1of1ForFork3_#t~ite7=|v_P0Thread1of1ForFork3_#t~ite7_1|, #memory_int=|v_#memory_int_275|, ~#x~0.base=|v_~#x~0.base_192|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P0Thread1of1ForFork3_#t~ite10=|v_P0Thread1of1ForFork3_#t~ite10_1|} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~mem6_28|, |v_P0_#t~ite10_29|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, P0Thread1of1ForFork3_#t~mem9, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork3_#t~mem8, P0Thread1of1ForFork3_#t~mem5, P0Thread1of1ForFork3_#t~mem6, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork3_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork3_#t~nondet3, P0Thread1of1ForFork3_#t~ite10, P0Thread1of1ForFork3_#t~nondet4] [2022-12-06 06:44:07,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [919] $Ultimate##0-->L807: Formula: (and (= v_~x$w_buff0_used~0_436 v_~x$w_buff1_used~0_424) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff0_thd3~0_155 v_~x$r_buff1_thd3~0_159) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~x$r_buff1_thd2~0_88 v_~x$r_buff0_thd2~0_110) (= v_~x$r_buff1_thd4~0_74 v_~x$r_buff0_thd4~0_80) (= v_~x$w_buff0_used~0_435 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_435 256) 0)) (not (= (mod v_~x$w_buff1_used~0_424 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_117 v_~x$r_buff1_thd0~0_119) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_215) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_109 1) (= v_~x$r_buff1_thd1~0_94 v_~x$r_buff0_thd1~0_93)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_436, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_215, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_424, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_74, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_435, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [791] L860-->L867: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd4~0_45 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_240 256) 0))) (.cse1 (not .cse9)) (.cse6 (= (mod v_~x$r_buff1_thd4~0_37 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_229 256) 0)) (.cse8 (= (mod v_~x$w_buff0_used~0_241 256) 0))) (let ((.cse2 (not .cse8)) (.cse0 (select |v_#memory_int_208| |v_~#x~0.base_150|)) (.cse5 (not .cse7)) (.cse4 (not .cse6)) (.cse10 (and .cse11 .cse1))) (and (= (store |v_#memory_int_208| |v_~#x~0.base_150| (store .cse0 |v_~#x~0.offset_150| |v_P3_#t~ite35_29|)) |v_#memory_int_207|) (= (ite (and .cse1 .cse2) 0 v_~x$w_buff0_used~0_241) v_~x$w_buff0_used~0_240) (let ((.cse3 (= |v_P3_#t~mem33_34| |v_P3Thread1of1ForFork0_#t~mem33_1|))) (or (and (= |v_P3_#t~ite34_31| |v_P3Thread1of1ForFork0_#t~ite34_1|) (= |v_P3_#t~ite35_29| v_~x$w_buff0~0_81) .cse1 .cse3 .cse2) (and (or (and .cse4 (= |v_P3_#t~ite34_31| v_~x$w_buff1~0_90) .cse3 .cse5) (and (or .cse6 .cse7) (= (select .cse0 |v_~#x~0.offset_150|) |v_P3_#t~mem33_34|) (= |v_P3_#t~ite34_31| |v_P3_#t~mem33_34|))) (or .cse8 .cse9) (= |v_P3_#t~ite34_31| |v_P3_#t~ite35_29|)))) (= v_~x$w_buff1_used~0_228 (ite (or .cse10 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_229)) (= v_~x$r_buff1_thd4~0_36 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_228 256) 0))) (and .cse11 (not (= 0 (mod v_~x$r_buff0_thd4~0_44 256))))) 0 v_~x$r_buff1_thd4~0_37)) (= (ite .cse10 0 v_~x$r_buff0_thd4~0_45) v_~x$r_buff0_thd4~0_44))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_81, ~#x~0.offset=|v_~#x~0.offset_150|, ~x$w_buff1~0=v_~x$w_buff1~0_90, #memory_int=|v_#memory_int_208|, ~#x~0.base=|v_~#x~0.base_150|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_229, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_45, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~mem33=|v_P3Thread1of1ForFork0_#t~mem33_1|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_241} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_81, ~#x~0.offset=|v_~#x~0.offset_150|, ~x$w_buff1~0=v_~x$w_buff1~0_90, #memory_int=|v_#memory_int_207|, ~#x~0.base=|v_~#x~0.base_150|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_228, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_44, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240} AuxVars[|v_P3_#t~ite35_29|, |v_P3_#t~ite34_31|, |v_P3_#t~mem33_34|] AssignedVars[#memory_int, ~x$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite35, ~x$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~mem33, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:44:07,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [919] $Ultimate##0-->L807: Formula: (and (= v_~x$w_buff0_used~0_436 v_~x$w_buff1_used~0_424) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff0_thd3~0_155 v_~x$r_buff1_thd3~0_159) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~x$r_buff1_thd2~0_88 v_~x$r_buff0_thd2~0_110) (= v_~x$r_buff1_thd4~0_74 v_~x$r_buff0_thd4~0_80) (= v_~x$w_buff0_used~0_435 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_435 256) 0)) (not (= (mod v_~x$w_buff1_used~0_424 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_117 v_~x$r_buff1_thd0~0_119) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_215) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_109 1) (= v_~x$r_buff1_thd1~0_94 v_~x$r_buff0_thd1~0_93)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_436, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_215, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_424, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_74, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_435, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [901] L895-->L902: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_91 256) 0))) (let ((.cse10 (not (= (mod v_~x$w_buff0_used~0_380 256) 0))) (.cse0 (not .cse8)) (.cse6 (= (mod v_~x$r_buff1_thd0~0_92 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_374 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_381 256) 0))) (let ((.cse1 (not .cse9)) (.cse5 (select |v_#memory_int_392| |v_~#x~0.base_230|)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse11 (and .cse10 .cse0))) (and (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_381) v_~x$w_buff0_used~0_380) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem44#1_94| |v_ULTIMATE.start_main_#t~mem44#1_96|))) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_95| |v_ULTIMATE.start_main_#t~ite46#1_78|) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite45#1_95| v_~x$w_buff1~0_189) .cse4) (and (= |v_ULTIMATE.start_main_#t~mem44#1_94| (select .cse5 |v_~#x~0.offset_230|)) (or .cse6 .cse7) (= |v_ULTIMATE.start_main_#t~ite45#1_95| |v_ULTIMATE.start_main_#t~mem44#1_94|))) (or .cse8 .cse9)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite46#1_78| v_~x$w_buff0~0_177) .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite45#1_97| |v_ULTIMATE.start_main_#t~ite45#1_95|)))) (= (store |v_#memory_int_392| |v_~#x~0.base_230| (store .cse5 |v_~#x~0.offset_230| |v_ULTIMATE.start_main_#t~ite46#1_78|)) |v_#memory_int_391|) (= v_~x$r_buff1_thd0~0_91 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_373 256) 0)) .cse4) (and .cse10 (not (= (mod v_~x$r_buff0_thd0~0_90 256) 0)))) 0 v_~x$r_buff1_thd0~0_92)) (= v_~x$w_buff1_used~0_373 (ite (or (and .cse3 .cse4) .cse11) 0 v_~x$w_buff1_used~0_374)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| 0)) (= v_~x$r_buff0_thd0~0_90 (ite .cse11 0 v_~x$r_buff0_thd0~0_91)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_177, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_96|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, ~#x~0.offset=|v_~#x~0.offset_230|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_97|, ~x$w_buff1~0=v_~x$w_buff1~0_189, #memory_int=|v_#memory_int_392|, ~#x~0.base=|v_~#x~0.base_230|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_381, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_177, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_90, ~#x~0.offset=|v_~#x~0.offset_230|, ~x$w_buff1~0=v_~x$w_buff1~0_189, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_373, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_380, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_77|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, #memory_int=|v_#memory_int_391|, ~#x~0.base=|v_~#x~0.base_230|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} AuxVars[|v_ULTIMATE.start_main_#t~ite46#1_78|, |v_ULTIMATE.start_main_#t~mem44#1_94|, |v_ULTIMATE.start_main_#t~ite45#1_95|] AssignedVars[ULTIMATE.start_main_#t~mem44#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite46#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite45#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 06:44:08,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [919] $Ultimate##0-->L807: Formula: (and (= v_~x$w_buff0_used~0_436 v_~x$w_buff1_used~0_424) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff0_thd3~0_155 v_~x$r_buff1_thd3~0_159) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~x$r_buff1_thd2~0_88 v_~x$r_buff0_thd2~0_110) (= v_~x$r_buff1_thd4~0_74 v_~x$r_buff0_thd4~0_80) (= v_~x$w_buff0_used~0_435 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_435 256) 0)) (not (= (mod v_~x$w_buff1_used~0_424 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_117 v_~x$r_buff1_thd0~0_119) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_215) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_109 1) (= v_~x$r_buff1_thd1~0_94 v_~x$r_buff0_thd1~0_93)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_436, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_215, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_424, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_74, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_435, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [857] L889-3-->L891-2: Formula: (and (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2424~0#1.base_18|) (= |v_#pthreadsForks_45| (+ |v_#pthreadsForks_46| 1)) (= (store |v_#length_53| |v_ULTIMATE.start_main_~#t2424~0#1.base_18| 4) |v_#length_52|) (= (store |v_#valid_92| |v_ULTIMATE.start_main_~#t2424~0#1.base_18| 1) |v_#valid_91|) (= (select |v_#valid_92| |v_ULTIMATE.start_main_~#t2424~0#1.base_18|) 0) (= (store |v_#memory_int_352| |v_ULTIMATE.start_main_~#t2424~0#1.base_18| (store (select |v_#memory_int_352| |v_ULTIMATE.start_main_~#t2424~0#1.base_18|) |v_ULTIMATE.start_main_~#t2424~0#1.offset_14| |v_ULTIMATE.start_main_#t~pre42#1_15|)) |v_#memory_int_351|) (= |v_ULTIMATE.start_main_~#t2424~0#1.offset_14| 0) (not (= |v_ULTIMATE.start_main_~#t2424~0#1.base_18| 0)) (= |v_#pthreadsForks_46| |v_ULTIMATE.start_main_#t~pre42#1_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_46|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_352|, #length=|v_#length_53|} OutVars{ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_7|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #pthreadsForks=|v_#pthreadsForks_45|, ULTIMATE.start_main_~#t2424~0#1.offset=|v_ULTIMATE.start_main_~#t2424~0#1.offset_14|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_351|, #length=|v_#length_52|, ULTIMATE.start_main_#t~pre40#1=|v_ULTIMATE.start_main_#t~pre40#1_21|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_15|, ULTIMATE.start_main_~#t2424~0#1.base=|v_ULTIMATE.start_main_~#t2424~0#1.base_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41#1, #pthreadsForks, ULTIMATE.start_main_~#t2424~0#1.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~pre40#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_~#t2424~0#1.base] [2022-12-06 06:44:08,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:08,597 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2728 [2022-12-06 06:44:08,598 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 153 flow [2022-12-06 06:44:08,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:08,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:08,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:08,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:44:08,598 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1780204638, now seen corresponding path program 2 times [2022-12-06 06:44:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:08,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948595457] [2022-12-06 06:44:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:10,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:10,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948595457] [2022-12-06 06:44:10,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948595457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:10,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:10,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:44:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509198237] [2022-12-06 06:44:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:10,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:44:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:10,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:44:10,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:44:10,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 06:44:10,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 153 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:10,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:10,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 06:44:10,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:10,570 INFO L130 PetriNetUnfolder]: 2046/2848 cut-off events. [2022-12-06 06:44:10,570 INFO L131 PetriNetUnfolder]: For 2749/2781 co-relation queries the response was YES. [2022-12-06 06:44:10,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8941 conditions, 2848 events. 2046/2848 cut-off events. For 2749/2781 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12944 event pairs, 386 based on Foata normal form. 18/2866 useless extension candidates. Maximal degree in co-relation 8927. Up to 2627 conditions per place. [2022-12-06 06:44:10,587 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 49 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2022-12-06 06:44:10,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 413 flow [2022-12-06 06:44:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:44:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:44:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 06:44:10,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-06 06:44:10,590 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 153 flow. Second operand 4 states and 64 transitions. [2022-12-06 06:44:10,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 413 flow [2022-12-06 06:44:10,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:44:10,598 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 249 flow [2022-12-06 06:44:10,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2022-12-06 06:44:10,600 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2022-12-06 06:44:10,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:10,600 INFO L89 Accepts]: Start accepts. Operand has 44 places, 40 transitions, 249 flow [2022-12-06 06:44:10,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:10,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:10,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 40 transitions, 249 flow [2022-12-06 06:44:10,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 249 flow [2022-12-06 06:44:10,664 INFO L130 PetriNetUnfolder]: 256/447 cut-off events. [2022-12-06 06:44:10,664 INFO L131 PetriNetUnfolder]: For 571/641 co-relation queries the response was YES. [2022-12-06 06:44:10,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 447 events. 256/447 cut-off events. For 571/641 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2053 event pairs, 97 based on Foata normal form. 20/459 useless extension candidates. Maximal degree in co-relation 1445. Up to 363 conditions per place. [2022-12-06 06:44:10,667 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 40 transitions, 249 flow [2022-12-06 06:44:10,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 06:44:10,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:10,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 06:44:10,675 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 249 flow [2022-12-06 06:44:10,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:10,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:10,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:10,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:44:10,677 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1462302335, now seen corresponding path program 1 times [2022-12-06 06:44:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:10,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192434795] [2022-12-06 06:44:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:10,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192434795] [2022-12-06 06:44:10,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192434795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:10,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:10,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:10,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715437495] [2022-12-06 06:44:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:10,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:44:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:44:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:44:10,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 06:44:10,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:10,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:10,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 06:44:10,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:11,399 INFO L130 PetriNetUnfolder]: 1910/2733 cut-off events. [2022-12-06 06:44:11,399 INFO L131 PetriNetUnfolder]: For 5673/5673 co-relation queries the response was YES. [2022-12-06 06:44:11,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9755 conditions, 2733 events. 1910/2733 cut-off events. For 5673/5673 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12371 event pairs, 268 based on Foata normal form. 238/2971 useless extension candidates. Maximal degree in co-relation 9738. Up to 1826 conditions per place. [2022-12-06 06:44:11,412 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 65 selfloop transitions, 5 changer transitions 50/121 dead transitions. [2022-12-06 06:44:11,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 121 transitions, 1033 flow [2022-12-06 06:44:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 06:44:11,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-06 06:44:11,413 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 249 flow. Second operand 5 states and 88 transitions. [2022-12-06 06:44:11,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 121 transitions, 1033 flow [2022-12-06 06:44:11,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 121 transitions, 997 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:44:11,417 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 288 flow [2022-12-06 06:44:11,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-06 06:44:11,418 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2022-12-06 06:44:11,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:11,418 INFO L89 Accepts]: Start accepts. Operand has 50 places, 44 transitions, 288 flow [2022-12-06 06:44:11,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:11,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:11,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 288 flow [2022-12-06 06:44:11,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 288 flow [2022-12-06 06:44:11,565 INFO L130 PetriNetUnfolder]: 645/1088 cut-off events. [2022-12-06 06:44:11,565 INFO L131 PetriNetUnfolder]: For 1728/1795 co-relation queries the response was YES. [2022-12-06 06:44:11,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 1088 events. 645/1088 cut-off events. For 1728/1795 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5993 event pairs, 261 based on Foata normal form. 14/1040 useless extension candidates. Maximal degree in co-relation 3750. Up to 632 conditions per place. [2022-12-06 06:44:11,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 288 flow [2022-12-06 06:44:11,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 06:44:11,578 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:11,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 06:44:11,579 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 288 flow [2022-12-06 06:44:11,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:11,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:11,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:11,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:44:11,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash -768412666, now seen corresponding path program 1 times [2022-12-06 06:44:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:11,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949239047] [2022-12-06 06:44:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:11,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-06 06:44:11,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:11,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949239047] [2022-12-06 06:44:11,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949239047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:11,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:11,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:44:11,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371197021] [2022-12-06 06:44:11,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:11,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:44:11,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:11,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:44:11,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:44:11,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 06:44:11,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:11,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:11,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 06:44:11,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:12,302 INFO L130 PetriNetUnfolder]: 1070/1619 cut-off events. [2022-12-06 06:44:12,302 INFO L131 PetriNetUnfolder]: For 4310/4310 co-relation queries the response was YES. [2022-12-06 06:44:12,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 1619 events. 1070/1619 cut-off events. For 4310/4310 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7188 event pairs, 89 based on Foata normal form. 165/1784 useless extension candidates. Maximal degree in co-relation 6787. Up to 763 conditions per place. [2022-12-06 06:44:12,310 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 83 selfloop transitions, 9 changer transitions 45/138 dead transitions. [2022-12-06 06:44:12,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 138 transitions, 1220 flow [2022-12-06 06:44:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:44:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:44:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-06 06:44:12,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2022-12-06 06:44:12,312 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 288 flow. Second operand 6 states and 106 transitions. [2022-12-06 06:44:12,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 138 transitions, 1220 flow [2022-12-06 06:44:12,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 138 transitions, 1211 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:12,318 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 355 flow [2022-12-06 06:44:12,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-06 06:44:12,321 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2022-12-06 06:44:12,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:12,321 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 355 flow [2022-12-06 06:44:12,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:12,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:12,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 355 flow [2022-12-06 06:44:12,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 355 flow [2022-12-06 06:44:12,428 INFO L130 PetriNetUnfolder]: 310/602 cut-off events. [2022-12-06 06:44:12,428 INFO L131 PetriNetUnfolder]: For 1429/1498 co-relation queries the response was YES. [2022-12-06 06:44:12,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 602 events. 310/602 cut-off events. For 1429/1498 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3144 event pairs, 81 based on Foata normal form. 27/606 useless extension candidates. Maximal degree in co-relation 2479. Up to 324 conditions per place. [2022-12-06 06:44:12,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 355 flow [2022-12-06 06:44:12,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 06:44:12,436 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:12,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 06:44:12,438 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 355 flow [2022-12-06 06:44:12,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:12,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:12,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:12,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:44:12,438 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2136975908, now seen corresponding path program 1 times [2022-12-06 06:44:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:12,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305944091] [2022-12-06 06:44:12,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:12,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:12,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305944091] [2022-12-06 06:44:12,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305944091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:12,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:12,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:44:12,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038721284] [2022-12-06 06:44:12,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:12,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:44:12,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:44:12,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:44:12,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 06:44:12,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-06 06:44:12,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:12,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 06:44:12,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:13,003 INFO L130 PetriNetUnfolder]: 601/946 cut-off events. [2022-12-06 06:44:13,003 INFO L131 PetriNetUnfolder]: For 2984/2984 co-relation queries the response was YES. [2022-12-06 06:44:13,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4375 conditions, 946 events. 601/946 cut-off events. For 2984/2984 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3896 event pairs, 53 based on Foata normal form. 65/1011 useless extension candidates. Maximal degree in co-relation 4351. Up to 433 conditions per place. [2022-12-06 06:44:13,008 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 89 selfloop transitions, 13 changer transitions 32/135 dead transitions. [2022-12-06 06:44:13,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 135 transitions, 1261 flow [2022-12-06 06:44:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:44:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:44:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-12-06 06:44:13,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5615763546798029 [2022-12-06 06:44:13,010 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 355 flow. Second operand 7 states and 114 transitions. [2022-12-06 06:44:13,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 135 transitions, 1261 flow [2022-12-06 06:44:13,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 135 transitions, 1188 flow, removed 29 selfloop flow, removed 5 redundant places. [2022-12-06 06:44:13,017 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 401 flow [2022-12-06 06:44:13,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-06 06:44:13,018 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2022-12-06 06:44:13,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:13,018 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 401 flow [2022-12-06 06:44:13,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:13,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:13,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 401 flow [2022-12-06 06:44:13,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 401 flow [2022-12-06 06:44:13,061 INFO L130 PetriNetUnfolder]: 158/345 cut-off events. [2022-12-06 06:44:13,061 INFO L131 PetriNetUnfolder]: For 746/805 co-relation queries the response was YES. [2022-12-06 06:44:13,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 345 events. 158/345 cut-off events. For 746/805 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1641 event pairs, 26 based on Foata normal form. 24/358 useless extension candidates. Maximal degree in co-relation 1298. Up to 159 conditions per place. [2022-12-06 06:44:13,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 401 flow [2022-12-06 06:44:13,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-06 06:44:13,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [864] $Ultimate##0-->L840: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd3~0_134 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_354 256) 0)) (.cse1 (mod v_~x$w_buff0_used~0_355 256)) (.cse10 (mod v_~weak$$choice0~0_88 256))) (let ((.cse24 (= .cse10 0)) (.cse16 (= (mod v_~weak$$choice2~0_94 256) 0)) (.cse2 (= .cse1 0)) (.cse17 (select |v_#memory_int_356| |v_~#x~0.base_218|)) (.cse25 (= (mod v_~x$w_buff1_used~0_344 256) 0)) (.cse13 (not .cse11)) (.cse4 (not .cse5))) (let ((.cse12 (and .cse13 .cse4)) (.cse9 (= (mod v_~weak$$choice1~0_66 256) 0)) (.cse6 (not .cse25)) (.cse15 (select .cse17 |v_~#x~0.offset_218|)) (.cse3 (not .cse2)) (.cse0 (not .cse16)) (.cse14 (not (= (mod v_~x$w_buff1_used~0_343 256) 0))) (.cse7 (= (mod v_~x$r_buff1_thd3~0_136 256) 0)) (.cse8 (not .cse24))) (and (= v_~weak$$choice0~0_88 |v_P2Thread1of1ForFork2_#t~nondet14_6|) (= v_~x$w_buff0_used~0_354 (ite (= (ite .cse0 .cse1 (ite .cse2 .cse1 (ite (and .cse3 .cse4) 0 (ite (and .cse3 .cse5 .cse6 .cse7) (ite (or .cse8 .cse9) 1 0) .cse10)))) 0) 0 1)) (= v_~x$flush_delayed~0_70 0) (= (ite .cse0 v_~x$r_buff0_thd3~0_134 (ite .cse11 v_~x$r_buff0_thd3~0_134 (ite .cse12 0 (ite (and .cse5 .cse13 .cse14 .cse7) v_~x$r_buff0_thd3~0_134 0)))) v_~x$r_buff0_thd3~0_133) (= v_~weak$$choice2~0_94 |v_P2Thread1of1ForFork2_#t~nondet15_6|) (= |v_~#x~0.base_218| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_34) (= v_~x$mem_tmp~0_40 .cse15) (= v_~x$w_buff0~0_158 v_~x$w_buff0~0_157) (= v_~weak$$choice1~0_66 |v_P2Thread1of1ForFork2_#t~nondet17_6|) (= v_~x$w_buff1_used~0_343 (ite .cse0 v_~x$w_buff1_used~0_344 (ite .cse11 v_~x$w_buff1_used~0_344 (ite .cse12 0 (ite (and .cse5 .cse13 .cse6 .cse7) v_~weak$$choice0~0_88 0))))) (or (and .cse16 (= |v_P2_#t~mem28_29| v_~__unbuffered_p2_EAX~0_57) (= |v_P2_#t~ite29_32| |v_P2_#t~mem28_29|)) (and (= |v_P2_#t~mem28_29| |v_P2Thread1of1ForFork2_#t~mem28_6|) (= |v_P2_#t~ite29_32| v_~x$mem_tmp~0_40) .cse0)) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_356| |v_~#x~0.base_218| (store .cse17 |v_~#x~0.offset_218| |v_P2_#t~ite29_32|)) |v_#memory_int_355|) (= v_~x$w_buff1~0_166 v_~x$w_buff1~0_165) (= v_~__unbuffered_p2_EAX$read_delayed~0_37 1) (let ((.cse22 (= |v_P2Thread1of1ForFork2_#t~ite24_6| |v_P2_#t~ite24_56|)) (.cse21 (= |v_P2Thread1of1ForFork2_#t~ite23_6| |v_P2_#t~ite23_58|)) (.cse18 (= |v_P2Thread1of1ForFork2_#t~ite20_6| |v_P2_#t~ite20_62|)) (.cse20 (= |v_P2_#t~mem19_59| |v_P2Thread1of1ForFork2_#t~mem19_6|)) (.cse19 (= |v_P2Thread1of1ForFork2_#t~ite22_6| |v_P2_#t~ite22_66|)) (.cse23 (= |v_P2_#t~mem21_69| |v_P2Thread1of1ForFork2_#t~mem21_6|))) (or (and .cse2 .cse18 .cse19 .cse20 .cse21 (= .cse15 |v_P2_#t~mem18_41|) (= |v_P2_#t~mem18_41| v_~__unbuffered_p2_EAX~0_57) .cse22 .cse23 (= |v_P2Thread1of1ForFork2_#t~ite25_6| |v_P2_#t~ite25_46|)) (and (or (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= |v_P2_#t~ite25_46| v_~x$w_buff0~0_158) .cse4) (and .cse5 (= |v_P2_#t~ite24_56| |v_P2_#t~ite25_46|) (or (and .cse19 .cse21 .cse23 .cse6 (or (and .cse8 (= .cse15 |v_P2_#t~mem19_59|) (= |v_P2_#t~ite20_62| |v_P2_#t~mem19_59|)) (and .cse24 (= |v_P2_#t~ite20_62| (ite (not .cse9) v_~x$w_buff0~0_158 v_~x$w_buff1~0_166)) .cse20)) (= |v_P2_#t~ite20_62| |v_P2_#t~ite24_56|) .cse7) (and .cse18 .cse20 (or (not .cse7) .cse25) (= |v_P2_#t~ite24_56| |v_P2_#t~ite23_58|) (or (and .cse19 .cse23 .cse6 (= |v_P2_#t~ite23_58| (ite .cse8 v_~x$w_buff1~0_166 v_~x$w_buff0~0_158))) (and (or (and .cse24 (= |v_P2_#t~ite22_66| |v_P2_#t~mem21_69|) (= .cse15 |v_P2_#t~mem21_69|)) (and .cse8 .cse23 (= |v_P2_#t~ite22_66| v_~x$w_buff0~0_158))) (= |v_P2_#t~ite22_66| |v_P2_#t~ite23_58|) .cse25)))))) (= |v_P2_#t~ite25_46| v_~__unbuffered_p2_EAX~0_57) .cse3 (= |v_P2_#t~mem18_41| |v_P2Thread1of1ForFork2_#t~mem18_6|)))) (= v_~x$r_buff1_thd3~0_135 (ite .cse0 v_~x$r_buff1_thd3~0_136 (ite .cse11 v_~x$r_buff1_thd3~0_136 (let ((.cse26 (= (mod v_~x$r_buff0_thd3~0_133 256) 0))) (ite (and (not .cse26) .cse13) 0 (ite (and .cse13 .cse14 .cse26 .cse7) (ite .cse8 v_~x$r_buff1_thd3~0_136 0) 0)))))) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5) (= |v_~#x~0.offset_218| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_34))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_158, P2Thread1of1ForFork2_#t~mem18=|v_P2Thread1of1ForFork2_#t~mem18_6|, P2Thread1of1ForFork2_#t~mem28=|v_P2Thread1of1ForFork2_#t~mem28_6|, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#t~mem19=|v_P2Thread1of1ForFork2_#t~mem19_6|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_136, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, P2Thread1of1ForFork2_#t~nondet17=|v_P2Thread1of1ForFork2_#t~nondet17_6|, P2Thread1of1ForFork2_#t~nondet15=|v_P2Thread1of1ForFork2_#t~nondet15_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_355, P2Thread1of1ForFork2_#t~nondet14=|v_P2Thread1of1ForFork2_#t~nondet14_6|, P2Thread1of1ForFork2_#t~ite23=|v_P2Thread1of1ForFork2_#t~ite23_6|, P2Thread1of1ForFork2_#t~ite24=|v_P2Thread1of1ForFork2_#t~ite24_6|, P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_6|, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_6|, P2Thread1of1ForFork2_#t~ite22=|v_P2Thread1of1ForFork2_#t~ite22_6|, #memory_int=|v_#memory_int_356|, ~#x~0.base=|v_~#x~0.base_218|, P2Thread1of1ForFork2_#t~mem21=|v_P2Thread1of1ForFork2_#t~mem21_6|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_157, ~x$flush_delayed~0=v_~x$flush_delayed~0_70, P2Thread1of1ForFork2_#t~mem16=|v_P2Thread1of1ForFork2_#t~mem16_5|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_34, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_34, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_135, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_133, ~weak$$choice1~0=v_~weak$$choice1~0_66, P2Thread1of1ForFork2_#t~ite26=|v_P2Thread1of1ForFork2_#t~ite26_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_57, P2Thread1of1ForFork2_#t~ite29=|v_P2Thread1of1ForFork2_#t~ite29_5|, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_218|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#t~mem27=|v_P2Thread1of1ForFork2_#t~mem27_5|, ~x$w_buff1~0=v_~x$w_buff1~0_165, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_343, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_354, ~weak$$choice0~0=v_~weak$$choice0~0_88, #memory_int=|v_#memory_int_355|, ~#x~0.base=|v_~#x~0.base_218|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~weak$$choice2~0=v_~weak$$choice2~0_94} AuxVars[|v_P2_#t~ite29_32|, |v_P2_#t~ite24_56|, |v_P2_#t~ite25_46|, |v_P2_#t~ite22_66|, |v_P2_#t~ite20_62|, |v_P2_#t~ite23_58|, |v_P2_#t~mem19_59|, |v_P2_#t~mem21_69|, |v_P2_#t~mem28_29|, |v_P2_#t~mem18_41|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork2_#t~mem18, P2Thread1of1ForFork2_#t~mem19, ~x$flush_delayed~0, P2Thread1of1ForFork2_#t~mem16, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24, ~weak$$choice1~0, P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite22, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork2_#t~ite29, P2Thread1of1ForFork2_#t~mem28, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2_#t~mem27, ~x$w_buff1~0, ~x$w_buff1_used~0, P2Thread1of1ForFork2_#t~nondet17, P2Thread1of1ForFork2_#t~nondet15, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, P2Thread1of1ForFork2_#t~nondet14, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork2_#t~mem21, ~weak$$choice2~0] and [942] $Ultimate##0-->L814: Formula: (let ((.cse0 (= (mod v_~x$w_buff0_used~0_680 256) 0)) (.cse1 (not (= (mod v_~x$w_buff0_used~0_678 256) 0))) (.cse2 (not (= (mod v_~x$r_buff0_thd2~0_201 256) 0)))) (and (= (store |v_#memory_int_694| |v_~#x~0.base_341| (store (select |v_#memory_int_694| |v_~#x~0.base_341|) |v_~#x~0.offset_341| v_~x$w_buff0~0_385)) |v_#memory_int_693|) (= v_~x$r_buff0_thd0~0_179 v_~x$r_buff1_thd0~0_182) (= v_~x$w_buff0~0_385 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50| (ite .cse0 1 0)) (= (ite .cse1 0 1) v_~x$r_buff0_thd2~0_199) (= v_~x$w_buff0_used~0_678 0) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_42| |v_P1Thread1of1ForFork1_~arg#1.base_42|) (= v_~x$w_buff0~0_386 v_~x$w_buff1~0_368) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_42| |v_P1Thread1of1ForFork1_~arg#1.offset_42|) (= v_~x$r_buff0_thd1~0_189 v_~x$r_buff1_thd1~0_191) (= v_~x$r_buff0_thd3~0_232 v_~x$r_buff1_thd3~0_238) (= (ite (or .cse1 (and .cse2 (not .cse0))) 0 v_~x$w_buff0_used~0_680) v_~x$w_buff1_used~0_644) (= v_~x$r_buff0_thd4~0_135 v_~x$r_buff1_thd4~0_127) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_199 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_644 256) 0)))) 0 v_~x$r_buff0_thd2~0_201) v_~x$r_buff1_thd2~0_157) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_386, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_179, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_189, ~#x~0.offset=|v_~#x~0.offset_341|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_135, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_232, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_201, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_680, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_42|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_42|, #memory_int=|v_#memory_int_694|, ~#x~0.base=|v_~#x~0.base_341|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_385, P1Thread1of1ForFork1_#t~ite12#1=|v_P1Thread1of1ForFork1_#t~ite12#1_73|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_189, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_42|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_238, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_191, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_232, P1Thread1of1ForFork1_#t~ite13#1=|v_P1Thread1of1ForFork1_#t~ite13#1_39|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_42|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_42|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_179, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_42|, ~#x~0.offset=|v_~#x~0.offset_341|, ~x$w_buff1~0=v_~x$w_buff1~0_368, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_644, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_135, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_199, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_182, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_127, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_678, #memory_int=|v_#memory_int_693|, ~#x~0.base=|v_~#x~0.base_341|, P1Thread1of1ForFork1_#t~mem11#1=|v_P1Thread1of1ForFork1_#t~mem11#1_73|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~ite12#1, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_#t~ite13#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, #memory_int, P1Thread1of1ForFork1_#t~mem11#1] [2022-12-06 06:44:14,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L891-3-->L895: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_97 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_25|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet43#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [945] $Ultimate##0-->L902: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_186 256) 0))) (let ((.cse5 (not (= (mod v_~x$w_buff0_used~0_696 256) 0))) (.cse0 (not .cse2))) (let ((.cse1 (select |v_#memory_int_706| |v_~#x~0.base_347|)) (.cse3 (and .cse5 .cse0)) (.cse4 (= (mod v_~x$w_buff0_used~0_698 256) 0))) (and (= (ite .cse0 0 1) v_~x$w_buff0_used~0_696) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_178| |v_ULTIMATE.start_main_#t~ite45#1_180|) .cse0 (= |v_ULTIMATE.start_main_#t~mem44#1_179| |v_ULTIMATE.start_main_#t~mem44#1_177|) (= |v_ULTIMATE.start_main_#t~ite46#1_151| v_~x$w_buff0~0_399)) (and (= |v_ULTIMATE.start_main_#t~ite45#1_178| |v_ULTIMATE.start_main_#t~ite46#1_151|) (= (select .cse1 |v_~#x~0.offset_347|) |v_ULTIMATE.start_main_#t~mem44#1_177|) .cse2 (= |v_ULTIMATE.start_main_#t~ite45#1_178| |v_ULTIMATE.start_main_#t~mem44#1_177|))) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_48| |v_P1Thread1of1ForFork1_~arg#1.offset_48|) (= (store |v_#memory_int_706| |v_~#x~0.base_347| (store .cse1 |v_~#x~0.offset_347| |v_ULTIMATE.start_main_#t~ite46#1_151|)) |v_#memory_int_705|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| 0)) (= v_~x$r_buff0_thd3~0_238 v_~x$r_buff1_thd3~0_244) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= v_~x$r_buff0_thd0~0_185 (ite .cse3 0 v_~x$r_buff0_thd0~0_186)) (= v_~x$w_buff0~0_399 1) (= v_~x$r_buff0_thd1~0_197 v_~x$r_buff1_thd1~0_199) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_48| |v_P1Thread1of1ForFork1_~arg#1.base_48|) (= v_~x$w_buff1_used~0_656 (ite (or .cse3 (and .cse0 (not .cse4))) 0 v_~x$w_buff0_used~0_698)) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| 0)) (= (ite (or (and .cse5 (not (= (mod v_~x$r_buff0_thd0~0_185 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_656 256) 0)) .cse0)) 0 v_~x$r_buff0_thd0~0_186) v_~x$r_buff1_thd0~0_188) (= v_~x$w_buff0~0_400 v_~x$w_buff1~0_376) (= v_~x$r_buff0_thd2~0_214 v_~x$r_buff1_thd2~0_165) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|) (= v_~x$r_buff0_thd2~0_213 1) (= v_~x$r_buff0_thd4~0_143 v_~x$r_buff1_thd4~0_135))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_197, ~#x~0.offset=|v_~#x~0.offset_347|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_180|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_143, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_238, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_214, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_698, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_179|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, #memory_int=|v_#memory_int_706|, ~#x~0.base=|v_~#x~0.base_347|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_399, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_197, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_48|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_244, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_238, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_79|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_185, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_48|, ~#x~0.offset=|v_~#x~0.offset_347|, ~x$w_buff1~0=v_~x$w_buff1~0_376, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_656, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_165, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_143, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_135, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_696, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_150|, #memory_int=|v_#memory_int_705|, ~#x~0.base=|v_~#x~0.base_347|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[|v_ULTIMATE.start_main_#t~mem44#1_177|, |v_ULTIMATE.start_main_#t~ite46#1_151|, |v_ULTIMATE.start_main_#t~ite45#1_178|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ULTIMATE.start_main_#t~ite45#1, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~mem44#1, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int] [2022-12-06 06:44:15,293 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:44:15,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2276 [2022-12-06 06:44:15,294 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 414 flow [2022-12-06 06:44:15,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-06 06:44:15,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:15,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:15,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:44:15,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1048701929, now seen corresponding path program 1 times [2022-12-06 06:44:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:15,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657881486] [2022-12-06 06:44:15,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:15,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657881486] [2022-12-06 06:44:15,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657881486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:15,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:15,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:44:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912502431] [2022-12-06 06:44:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:15,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:44:15,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:44:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:44:15,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 06:44:15,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 414 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:15,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:15,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 06:44:15,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:15,879 INFO L130 PetriNetUnfolder]: 487/757 cut-off events. [2022-12-06 06:44:15,879 INFO L131 PetriNetUnfolder]: For 2329/2332 co-relation queries the response was YES. [2022-12-06 06:44:15,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3443 conditions, 757 events. 487/757 cut-off events. For 2329/2332 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2964 event pairs, 51 based on Foata normal form. 13/769 useless extension candidates. Maximal degree in co-relation 3419. Up to 353 conditions per place. [2022-12-06 06:44:15,883 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 84 selfloop transitions, 17 changer transitions 12/114 dead transitions. [2022-12-06 06:44:15,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 114 transitions, 1082 flow [2022-12-06 06:44:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:44:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:44:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-12-06 06:44:15,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2022-12-06 06:44:15,885 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 414 flow. Second operand 8 states and 101 transitions. [2022-12-06 06:44:15,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 114 transitions, 1082 flow [2022-12-06 06:44:15,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 114 transitions, 1000 flow, removed 26 selfloop flow, removed 6 redundant places. [2022-12-06 06:44:15,891 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 376 flow [2022-12-06 06:44:15,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2022-12-06 06:44:15,891 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2022-12-06 06:44:15,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:15,891 INFO L89 Accepts]: Start accepts. Operand has 58 places, 51 transitions, 376 flow [2022-12-06 06:44:15,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:15,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:15,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 51 transitions, 376 flow [2022-12-06 06:44:15,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 51 transitions, 376 flow [2022-12-06 06:44:15,927 INFO L130 PetriNetUnfolder]: 138/296 cut-off events. [2022-12-06 06:44:15,928 INFO L131 PetriNetUnfolder]: For 520/566 co-relation queries the response was YES. [2022-12-06 06:44:15,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 296 events. 138/296 cut-off events. For 520/566 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1399 event pairs, 22 based on Foata normal form. 6/289 useless extension candidates. Maximal degree in co-relation 1053. Up to 126 conditions per place. [2022-12-06 06:44:15,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 51 transitions, 376 flow [2022-12-06 06:44:15,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 06:44:17,243 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:44:17,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1353 [2022-12-06 06:44:17,244 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 372 flow [2022-12-06 06:44:17,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:17,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:17,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:17,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:44:17,245 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash 668581606, now seen corresponding path program 1 times [2022-12-06 06:44:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:17,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243438984] [2022-12-06 06:44:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:19,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243438984] [2022-12-06 06:44:19,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243438984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:19,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:19,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:44:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315151028] [2022-12-06 06:44:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:19,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:44:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:19,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:44:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:44:19,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 06:44:19,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 372 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:19,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:19,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 06:44:19,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:19,866 INFO L130 PetriNetUnfolder]: 722/1167 cut-off events. [2022-12-06 06:44:19,867 INFO L131 PetriNetUnfolder]: For 3328/3328 co-relation queries the response was YES. [2022-12-06 06:44:19,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5174 conditions, 1167 events. 722/1167 cut-off events. For 3328/3328 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5683 event pairs, 101 based on Foata normal form. 2/1169 useless extension candidates. Maximal degree in co-relation 5150. Up to 552 conditions per place. [2022-12-06 06:44:19,879 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 91 selfloop transitions, 17 changer transitions 33/142 dead transitions. [2022-12-06 06:44:19,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 142 transitions, 1377 flow [2022-12-06 06:44:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:44:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:44:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-06 06:44:19,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2022-12-06 06:44:19,881 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 372 flow. Second operand 7 states and 78 transitions. [2022-12-06 06:44:19,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 142 transitions, 1377 flow [2022-12-06 06:44:19,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 142 transitions, 1109 flow, removed 70 selfloop flow, removed 7 redundant places. [2022-12-06 06:44:19,893 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 403 flow [2022-12-06 06:44:19,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2022-12-06 06:44:19,893 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2022-12-06 06:44:19,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:19,893 INFO L89 Accepts]: Start accepts. Operand has 57 places, 54 transitions, 403 flow [2022-12-06 06:44:19,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:19,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:19,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 54 transitions, 403 flow [2022-12-06 06:44:19,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 403 flow [2022-12-06 06:44:19,938 INFO L130 PetriNetUnfolder]: 197/431 cut-off events. [2022-12-06 06:44:19,938 INFO L131 PetriNetUnfolder]: For 1348/1461 co-relation queries the response was YES. [2022-12-06 06:44:19,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 431 events. 197/431 cut-off events. For 1348/1461 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2476 event pairs, 21 based on Foata normal form. 32/439 useless extension candidates. Maximal degree in co-relation 1478. Up to 148 conditions per place. [2022-12-06 06:44:19,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 403 flow [2022-12-06 06:44:19,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-06 06:44:19,942 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:19,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 06:44:19,943 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 403 flow [2022-12-06 06:44:19,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:19,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:19,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:19,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:44:19,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash -675814456, now seen corresponding path program 2 times [2022-12-06 06:44:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:19,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362068185] [2022-12-06 06:44:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:20,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362068185] [2022-12-06 06:44:20,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362068185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:20,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:20,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:20,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195987467] [2022-12-06 06:44:20,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:20,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:44:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:20,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:44:20,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:44:20,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:44:20,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 403 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:20,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:20,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:44:20,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:20,450 INFO L130 PetriNetUnfolder]: 1196/1870 cut-off events. [2022-12-06 06:44:20,450 INFO L131 PetriNetUnfolder]: For 6389/6389 co-relation queries the response was YES. [2022-12-06 06:44:20,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8357 conditions, 1870 events. 1196/1870 cut-off events. For 6389/6389 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9032 event pairs, 182 based on Foata normal form. 2/1872 useless extension candidates. Maximal degree in co-relation 8332. Up to 917 conditions per place. [2022-12-06 06:44:20,458 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 64 selfloop transitions, 1 changer transitions 40/105 dead transitions. [2022-12-06 06:44:20,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 991 flow [2022-12-06 06:44:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:44:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:44:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:44:20,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 06:44:20,459 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 403 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:44:20,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 991 flow [2022-12-06 06:44:20,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 934 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:44:20,476 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 365 flow [2022-12-06 06:44:20,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-12-06 06:44:20,477 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2022-12-06 06:44:20,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:20,477 INFO L89 Accepts]: Start accepts. Operand has 58 places, 53 transitions, 365 flow [2022-12-06 06:44:20,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:20,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:20,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 365 flow [2022-12-06 06:44:20,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions, 365 flow [2022-12-06 06:44:20,526 INFO L130 PetriNetUnfolder]: 203/467 cut-off events. [2022-12-06 06:44:20,526 INFO L131 PetriNetUnfolder]: For 1173/1287 co-relation queries the response was YES. [2022-12-06 06:44:20,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 467 events. 203/467 cut-off events. For 1173/1287 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2815 event pairs, 22 based on Foata normal form. 22/464 useless extension candidates. Maximal degree in co-relation 1579. Up to 167 conditions per place. [2022-12-06 06:44:20,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 53 transitions, 365 flow [2022-12-06 06:44:20,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 06:44:20,530 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:20,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 06:44:20,531 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 365 flow [2022-12-06 06:44:20,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:20,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:20,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:20,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:44:20,531 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1263538728, now seen corresponding path program 3 times [2022-12-06 06:44:20,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:20,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030153490] [2022-12-06 06:44:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030153490] [2022-12-06 06:44:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030153490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:22,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:22,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:44:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050190044] [2022-12-06 06:44:22,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:22,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:44:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:44:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:44:22,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 06:44:22,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 365 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:22,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:22,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 06:44:22,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:23,050 INFO L130 PetriNetUnfolder]: 756/1262 cut-off events. [2022-12-06 06:44:23,051 INFO L131 PetriNetUnfolder]: For 3776/3777 co-relation queries the response was YES. [2022-12-06 06:44:23,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 1262 events. 756/1262 cut-off events. For 3776/3777 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6220 event pairs, 126 based on Foata normal form. 1/1254 useless extension candidates. Maximal degree in co-relation 5560. Up to 805 conditions per place. [2022-12-06 06:44:23,072 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 54 selfloop transitions, 16 changer transitions 56/127 dead transitions. [2022-12-06 06:44:23,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 127 transitions, 1093 flow [2022-12-06 06:44:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:44:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:44:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-06 06:44:23,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2022-12-06 06:44:23,074 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 365 flow. Second operand 7 states and 78 transitions. [2022-12-06 06:44:23,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 127 transitions, 1093 flow [2022-12-06 06:44:23,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 127 transitions, 1087 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:23,086 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 466 flow [2022-12-06 06:44:23,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2022-12-06 06:44:23,087 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-12-06 06:44:23,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:23,087 INFO L89 Accepts]: Start accepts. Operand has 64 places, 59 transitions, 466 flow [2022-12-06 06:44:23,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:23,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:23,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 59 transitions, 466 flow [2022-12-06 06:44:23,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 466 flow [2022-12-06 06:44:23,127 INFO L130 PetriNetUnfolder]: 158/353 cut-off events. [2022-12-06 06:44:23,128 INFO L131 PetriNetUnfolder]: For 1014/1128 co-relation queries the response was YES. [2022-12-06 06:44:23,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 353 events. 158/353 cut-off events. For 1014/1128 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1964 event pairs, 16 based on Foata normal form. 21/353 useless extension candidates. Maximal degree in co-relation 1342. Up to 142 conditions per place. [2022-12-06 06:44:23,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 59 transitions, 466 flow [2022-12-06 06:44:23,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-06 06:44:23,155 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [942] $Ultimate##0-->L814: Formula: (let ((.cse0 (= (mod v_~x$w_buff0_used~0_680 256) 0)) (.cse1 (not (= (mod v_~x$w_buff0_used~0_678 256) 0))) (.cse2 (not (= (mod v_~x$r_buff0_thd2~0_201 256) 0)))) (and (= (store |v_#memory_int_694| |v_~#x~0.base_341| (store (select |v_#memory_int_694| |v_~#x~0.base_341|) |v_~#x~0.offset_341| v_~x$w_buff0~0_385)) |v_#memory_int_693|) (= v_~x$r_buff0_thd0~0_179 v_~x$r_buff1_thd0~0_182) (= v_~x$w_buff0~0_385 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50| (ite .cse0 1 0)) (= (ite .cse1 0 1) v_~x$r_buff0_thd2~0_199) (= v_~x$w_buff0_used~0_678 0) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_42| |v_P1Thread1of1ForFork1_~arg#1.base_42|) (= v_~x$w_buff0~0_386 v_~x$w_buff1~0_368) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_42| |v_P1Thread1of1ForFork1_~arg#1.offset_42|) (= v_~x$r_buff0_thd1~0_189 v_~x$r_buff1_thd1~0_191) (= v_~x$r_buff0_thd3~0_232 v_~x$r_buff1_thd3~0_238) (= (ite (or .cse1 (and .cse2 (not .cse0))) 0 v_~x$w_buff0_used~0_680) v_~x$w_buff1_used~0_644) (= v_~x$r_buff0_thd4~0_135 v_~x$r_buff1_thd4~0_127) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_199 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_644 256) 0)))) 0 v_~x$r_buff0_thd2~0_201) v_~x$r_buff1_thd2~0_157) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_386, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_179, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_189, ~#x~0.offset=|v_~#x~0.offset_341|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_135, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_232, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_201, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_680, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_42|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_42|, #memory_int=|v_#memory_int_694|, ~#x~0.base=|v_~#x~0.base_341|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_385, P1Thread1of1ForFork1_#t~ite12#1=|v_P1Thread1of1ForFork1_#t~ite12#1_73|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_189, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_42|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_238, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_191, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_232, P1Thread1of1ForFork1_#t~ite13#1=|v_P1Thread1of1ForFork1_#t~ite13#1_39|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_42|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_42|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_179, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_42|, ~#x~0.offset=|v_~#x~0.offset_341|, ~x$w_buff1~0=v_~x$w_buff1~0_368, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_644, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_135, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_199, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_182, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_127, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_678, #memory_int=|v_#memory_int_693|, ~#x~0.base=|v_~#x~0.base_341|, P1Thread1of1ForFork1_#t~mem11#1=|v_P1Thread1of1ForFork1_#t~mem11#1_73|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~ite12#1, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_#t~ite13#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, #memory_int, P1Thread1of1ForFork1_#t~mem11#1] and [785] L843-->L850: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_88 256) 0))) (let ((.cse8 (= (mod v_~x$w_buff0_used~0_255 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_245 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd3~0_86 256) 0)) (.cse5 (not .cse7)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_254 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse3 (select |v_#memory_int_234| |v_~#x~0.base_160|)) (.cse0 (not .cse10)) (.cse1 (not .cse9)) (.cse6 (not .cse8))) (and (= v_~x$w_buff1_used~0_244 (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_245)) (= (store |v_#memory_int_234| |v_~#x~0.base_160| (store .cse3 |v_~#x~0.offset_160| |v_P2_#t~ite32_29|)) |v_#memory_int_233|) (= v_~x$r_buff0_thd3~0_87 (ite .cse2 0 v_~x$r_buff0_thd3~0_88)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_244 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_87 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_86) v_~x$r_buff1_thd3~0_85) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_255) v_~x$w_buff0_used~0_254) (let ((.cse11 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork2_#t~mem30_1|))) (or (and (or .cse7 .cse8) (or (and (= (select .cse3 |v_~#x~0.offset_160|) |v_P2_#t~mem30_30|) (= |v_P2_#t~ite31_29| |v_P2_#t~mem30_30|) (or .cse9 .cse10)) (and (= |v_P2_#t~ite31_29| v_~x$w_buff1~0_104) .cse11 .cse0 .cse1)) (= |v_P2_#t~ite31_29| |v_P2_#t~ite32_29|)) (and .cse5 .cse11 .cse6 (= |v_P2Thread1of1ForFork2_#t~ite31_1| |v_P2_#t~ite31_29|) (= |v_P2_#t~ite32_29| v_~x$w_buff0~0_91)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_1|, ~#x~0.offset=|v_~#x~0.offset_160|, ~x$w_buff1~0=v_~x$w_buff1~0_104, #memory_int=|v_#memory_int_234|, ~#x~0.base=|v_~#x~0.base_160|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_86, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_88, P2Thread1of1ForFork2_#t~mem30=|v_P2Thread1of1ForFork2_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_255} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_91, ~#x~0.offset=|v_~#x~0.offset_160|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_104, #memory_int=|v_#memory_int_233|, ~#x~0.base=|v_~#x~0.base_160|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_244, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} AuxVars[|v_P2_#t~ite31_29|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite32, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~mem30, ~x$w_buff0_used~0] [2022-12-06 06:44:23,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [942] $Ultimate##0-->L814: Formula: (let ((.cse0 (= (mod v_~x$w_buff0_used~0_680 256) 0)) (.cse1 (not (= (mod v_~x$w_buff0_used~0_678 256) 0))) (.cse2 (not (= (mod v_~x$r_buff0_thd2~0_201 256) 0)))) (and (= (store |v_#memory_int_694| |v_~#x~0.base_341| (store (select |v_#memory_int_694| |v_~#x~0.base_341|) |v_~#x~0.offset_341| v_~x$w_buff0~0_385)) |v_#memory_int_693|) (= v_~x$r_buff0_thd0~0_179 v_~x$r_buff1_thd0~0_182) (= v_~x$w_buff0~0_385 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50| (ite .cse0 1 0)) (= (ite .cse1 0 1) v_~x$r_buff0_thd2~0_199) (= v_~x$w_buff0_used~0_678 0) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_42| |v_P1Thread1of1ForFork1_~arg#1.base_42|) (= v_~x$w_buff0~0_386 v_~x$w_buff1~0_368) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_42| |v_P1Thread1of1ForFork1_~arg#1.offset_42|) (= v_~x$r_buff0_thd1~0_189 v_~x$r_buff1_thd1~0_191) (= v_~x$r_buff0_thd3~0_232 v_~x$r_buff1_thd3~0_238) (= (ite (or .cse1 (and .cse2 (not .cse0))) 0 v_~x$w_buff0_used~0_680) v_~x$w_buff1_used~0_644) (= v_~x$r_buff0_thd4~0_135 v_~x$r_buff1_thd4~0_127) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_199 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_644 256) 0)))) 0 v_~x$r_buff0_thd2~0_201) v_~x$r_buff1_thd2~0_157) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_386, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_179, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_189, ~#x~0.offset=|v_~#x~0.offset_341|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_135, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_232, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_201, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_680, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_42|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_42|, #memory_int=|v_#memory_int_694|, ~#x~0.base=|v_~#x~0.base_341|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_385, P1Thread1of1ForFork1_#t~ite12#1=|v_P1Thread1of1ForFork1_#t~ite12#1_73|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_189, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_42|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_238, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_191, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_232, P1Thread1of1ForFork1_#t~ite13#1=|v_P1Thread1of1ForFork1_#t~ite13#1_39|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_42|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_42|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_179, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_42|, ~#x~0.offset=|v_~#x~0.offset_341|, ~x$w_buff1~0=v_~x$w_buff1~0_368, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_644, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_135, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_199, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_182, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_127, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_678, #memory_int=|v_#memory_int_693|, ~#x~0.base=|v_~#x~0.base_341|, P1Thread1of1ForFork1_#t~mem11#1=|v_P1Thread1of1ForFork1_#t~mem11#1_73|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~ite12#1, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_#t~ite13#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, #memory_int, P1Thread1of1ForFork1_#t~mem11#1] and [791] L860-->L867: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd4~0_45 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_240 256) 0))) (.cse1 (not .cse9)) (.cse6 (= (mod v_~x$r_buff1_thd4~0_37 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_229 256) 0)) (.cse8 (= (mod v_~x$w_buff0_used~0_241 256) 0))) (let ((.cse2 (not .cse8)) (.cse0 (select |v_#memory_int_208| |v_~#x~0.base_150|)) (.cse5 (not .cse7)) (.cse4 (not .cse6)) (.cse10 (and .cse11 .cse1))) (and (= (store |v_#memory_int_208| |v_~#x~0.base_150| (store .cse0 |v_~#x~0.offset_150| |v_P3_#t~ite35_29|)) |v_#memory_int_207|) (= (ite (and .cse1 .cse2) 0 v_~x$w_buff0_used~0_241) v_~x$w_buff0_used~0_240) (let ((.cse3 (= |v_P3_#t~mem33_34| |v_P3Thread1of1ForFork0_#t~mem33_1|))) (or (and (= |v_P3_#t~ite34_31| |v_P3Thread1of1ForFork0_#t~ite34_1|) (= |v_P3_#t~ite35_29| v_~x$w_buff0~0_81) .cse1 .cse3 .cse2) (and (or (and .cse4 (= |v_P3_#t~ite34_31| v_~x$w_buff1~0_90) .cse3 .cse5) (and (or .cse6 .cse7) (= (select .cse0 |v_~#x~0.offset_150|) |v_P3_#t~mem33_34|) (= |v_P3_#t~ite34_31| |v_P3_#t~mem33_34|))) (or .cse8 .cse9) (= |v_P3_#t~ite34_31| |v_P3_#t~ite35_29|)))) (= v_~x$w_buff1_used~0_228 (ite (or .cse10 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_229)) (= v_~x$r_buff1_thd4~0_36 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_228 256) 0))) (and .cse11 (not (= 0 (mod v_~x$r_buff0_thd4~0_44 256))))) 0 v_~x$r_buff1_thd4~0_37)) (= (ite .cse10 0 v_~x$r_buff0_thd4~0_45) v_~x$r_buff0_thd4~0_44))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_81, ~#x~0.offset=|v_~#x~0.offset_150|, ~x$w_buff1~0=v_~x$w_buff1~0_90, #memory_int=|v_#memory_int_208|, ~#x~0.base=|v_~#x~0.base_150|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_229, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_45, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~mem33=|v_P3Thread1of1ForFork0_#t~mem33_1|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_241} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_81, ~#x~0.offset=|v_~#x~0.offset_150|, ~x$w_buff1~0=v_~x$w_buff1~0_90, #memory_int=|v_#memory_int_207|, ~#x~0.base=|v_~#x~0.base_150|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_228, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_44, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240} AuxVars[|v_P3_#t~ite35_29|, |v_P3_#t~ite34_31|, |v_P3_#t~mem33_34|] AssignedVars[#memory_int, ~x$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite35, ~x$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~mem33, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:44:24,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [940] $Ultimate##0-->L769: Formula: (and (= v_~y~0_55 1) (= |v_P3Thread1of1ForFork0_#in~arg.offset_19| v_P3Thread1of1ForFork0_~arg.offset_19) (= v_~y~0_55 v_~__unbuffered_p0_EAX~0_69) (= |v_P3Thread1of1ForFork0_#in~arg.base_19| v_P3Thread1of1ForFork0_~arg.base_19) (= |v_P0Thread1of1ForFork3_#in~arg.offset_17| v_P0Thread1of1ForFork3_~arg.offset_17) (= v_P0Thread1of1ForFork3_~arg.base_17 |v_P0Thread1of1ForFork3_#in~arg.base_17|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_19|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_69, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_17, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_19, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_17, ~y~0=v_~y~0_55, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_19} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P3Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork3_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [943] $Ultimate##0-->L785: Formula: (let ((.cse10 (= (mod v_~weak$$choice2~0_167 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_686 256) 0)) (.cse2 (= 0 (mod v_~x$r_buff0_thd1~0_192 256))) (.cse9 (select |v_#memory_int_698| |v_~#x~0.base_343|))) (let ((.cse3 (= (mod v_~x$w_buff1_used~0_648 256) 0)) (.cse6 (select .cse9 |v_~#x~0.offset_343|)) (.cse4 (= (mod v_~x$w_buff0_used~0_684 256) 0)) (.cse8 (and .cse7 .cse2)) (.cse5 (not .cse2)) (.cse0 (not .cse10))) (and (= v_~x$r_buff1_thd1~0_193 (ite .cse0 v_~x$r_buff0_thd1~0_192 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd1~0_191 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~x$r_buff0_thd1~0_192 0))) (= v_~x$r_buff0_thd1~0_191 (ite .cse0 v_~x$r_buff0_thd1~0_192 (ite (or .cse2 .cse4 (and .cse3 .cse2)) v_~x$r_buff0_thd1~0_192 (ite (and .cse5 (not .cse4)) 0 v_~x$r_buff0_thd1~0_192)))) (= .cse6 v_~x$mem_tmp~0_113) (= v_~x$r_buff0_thd3~0_234 v_~x$r_buff1_thd3~0_240) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_44| |v_P1Thread1of1ForFork1_~arg#1.base_44|) (= (ite .cse7 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|) (= v_~x$w_buff0~0_391 v_~x$w_buff1~0_370) (= |v_P0Thread1of1ForFork3_#t~nondet4_88| v_~weak$$choice2~0_167) (= v_~x$r_buff0_thd2~0_206 v_~x$r_buff1_thd2~0_161) (= v_~x$r_buff0_thd0~0_181 v_~x$r_buff1_thd0~0_184) (or (and .cse5 (= |v_P0Thread1of1ForFork3_#t~mem6_88| |v_P0_#t~mem6_72|) (= v_~__unbuffered_p0_EBX~0_119 (ite .cse5 1 v_~x$w_buff1~0_370))) (and (= .cse6 |v_P0_#t~mem6_72|) (= v_~__unbuffered_p0_EBX~0_119 |v_P0_#t~mem6_72|) .cse2)) (= (ite .cse0 v_~x$w_buff0_used~0_686 (ite (or .cse8 .cse2 .cse4) v_~x$w_buff0_used~0_686 0)) v_~x$w_buff1_used~0_648) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_52| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|) (= (store |v_#memory_int_698| |v_~#x~0.base_343| (store .cse9 |v_~#x~0.offset_343| |v_P0_#t~ite10_73|)) |v_#memory_int_697|) (= |v_P0Thread1of1ForFork3_#t~nondet3_88| v_~weak$$choice0~0_163) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_44| |v_P1Thread1of1ForFork1_~arg#1.offset_44|) (= v_~x$r_buff0_thd2~0_205 1) (= v_~x$w_buff0~0_389 1) (= v_~x$flush_delayed~0_143 0) (= (ite .cse0 1 (ite (or .cse8 .cse2) 1 (ite .cse5 0 1))) v_~x$w_buff0_used~0_684) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_52| 0)) (or (and .cse10 (= v_~__unbuffered_p0_EBX~0_119 |v_P0_#t~mem9_76|) (= |v_P0_#t~ite10_73| |v_P0_#t~mem9_76|)) (and (= |v_P0Thread1of1ForFork3_#t~mem9_88| |v_P0_#t~mem9_76|) (= |v_P0_#t~ite10_73| v_~x$mem_tmp~0_113) .cse0)) (= v_~x$r_buff0_thd4~0_137 v_~x$r_buff1_thd4~0_129)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_391, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_181, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_192, ~#x~0.offset=|v_~#x~0.offset_343|, P0Thread1of1ForFork3_#t~mem9=|v_P0Thread1of1ForFork3_#t~mem9_88|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_137, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_234, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_206, P0Thread1of1ForFork3_#t~mem6=|v_P0Thread1of1ForFork3_#t~mem6_88|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_686, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_44|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_44|, #memory_int=|v_#memory_int_698|, ~#x~0.base=|v_~#x~0.base_343|, P0Thread1of1ForFork3_#t~nondet3=|v_P0Thread1of1ForFork3_#t~nondet3_88|, P0Thread1of1ForFork3_#t~nondet4=|v_P0Thread1of1ForFork3_#t~nondet4_88|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_389, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_191, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_143, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_240, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_193, ~x$mem_tmp~0=v_~x$mem_tmp~0_113, P0Thread1of1ForFork3_#t~mem8=|v_P0Thread1of1ForFork3_#t~mem8_46|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_234, P0Thread1of1ForFork3_#t~mem5=|v_P0Thread1of1ForFork3_#t~mem5_46|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_44|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_44|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|, P0Thread1of1ForFork3_#t~ite10=|v_P0Thread1of1ForFork3_#t~ite10_46|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_181, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_119, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_44|, ~#x~0.offset=|v_~#x~0.offset_343|, ~x$w_buff1~0=v_~x$w_buff1~0_370, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_648, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_161, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_129, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_52|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_684, ~weak$$choice0~0=v_~weak$$choice0~0_163, P0Thread1of1ForFork3_#t~ite7=|v_P0Thread1of1ForFork3_#t~ite7_46|, #memory_int=|v_#memory_int_697|, ~#x~0.base=|v_~#x~0.base_343|, ~weak$$choice2~0=v_~weak$$choice2~0_167} AuxVars[|v_P0_#t~mem9_76|, |v_P0_#t~ite10_73|, |v_P0_#t~mem6_72|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, ~x$flush_delayed~0, P0Thread1of1ForFork3_#t~mem9, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork3_#t~mem8, P0Thread1of1ForFork3_#t~mem5, P0Thread1of1ForFork3_#t~mem6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork3_#t~ite10, ~__unbuffered_p0_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork3_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork3_#t~nondet3, P0Thread1of1ForFork3_#t~nondet4] [2022-12-06 06:44:24,559 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:44:24,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1473 [2022-12-06 06:44:24,560 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 468 flow [2022-12-06 06:44:24,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:24,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:24,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:24,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:44:24,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:44:24,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1528141483, now seen corresponding path program 1 times [2022-12-06 06:44:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:24,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668816295] [2022-12-06 06:44:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:44:24,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:44:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:44:24,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:44:24,715 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:44:24,716 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:44:24,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:44:24,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:44:24,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:44:24,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:44:24,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:44:24,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:44:24,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:44:24,717 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:24,721 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:44:24,721 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:44:24,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:44:24 BasicIcfg [2022-12-06 06:44:24,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:44:24,824 INFO L158 Benchmark]: Toolchain (without parser) took 47524.36ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 161.2MB in the beginning and 500.5MB in the end (delta: -339.3MB). Peak memory consumption was 739.7MB. Max. memory is 8.0GB. [2022-12-06 06:44:24,824 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory was 163.5MB in the beginning and 163.4MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:44:24,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.22ms. Allocated memory is still 186.6MB. Free memory was 160.7MB in the beginning and 131.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:44:24,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.05ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 128.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:44:24,824 INFO L158 Benchmark]: Boogie Preprocessor took 47.87ms. Allocated memory is still 186.6MB. Free memory was 128.7MB in the beginning and 126.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:44:24,824 INFO L158 Benchmark]: RCFGBuilder took 1027.51ms. Allocated memory was 186.6MB in the beginning and 263.2MB in the end (delta: 76.5MB). Free memory was 126.1MB in the beginning and 185.3MB in the end (delta: -59.3MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. [2022-12-06 06:44:24,825 INFO L158 Benchmark]: TraceAbstraction took 45885.19ms. Allocated memory was 263.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 184.8MB in the beginning and 500.5MB in the end (delta: -315.7MB). Peak memory consumption was 686.7MB. Max. memory is 8.0GB. [2022-12-06 06:44:24,826 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory was 163.5MB in the beginning and 163.4MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 486.22ms. Allocated memory is still 186.6MB. Free memory was 160.7MB in the beginning and 131.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.05ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 128.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.87ms. Allocated memory is still 186.6MB. Free memory was 128.7MB in the beginning and 126.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1027.51ms. Allocated memory was 186.6MB in the beginning and 263.2MB in the end (delta: 76.5MB). Free memory was 126.1MB in the beginning and 185.3MB in the end (delta: -59.3MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. * TraceAbstraction took 45885.19ms. Allocated memory was 263.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 184.8MB in the beginning and 500.5MB in the end (delta: -315.7MB). Peak memory consumption was 686.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.5s, 153 PlacesBefore, 43 PlacesAfterwards, 142 TransitionsBefore, 31 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1882, independent: 1826, independent conditional: 1826, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1882, independent: 1826, independent conditional: 0, independent unconditional: 1826, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1882, independent: 1826, independent conditional: 0, independent unconditional: 1826, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1882, independent: 1826, independent conditional: 0, independent unconditional: 1826, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1500, independent conditional: 0, independent unconditional: 1500, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1479, independent conditional: 0, independent unconditional: 1479, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 464, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 430, dependent conditional: 0, dependent unconditional: 430, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1882, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 2615, Positive cache size: 2567, Positive conditional cache size: 0, Positive unconditional cache size: 2567, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 35 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 82, independent conditional: 7, independent unconditional: 75, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 82, independent conditional: 7, independent unconditional: 75, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 82, independent conditional: 7, independent unconditional: 75, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, independent: 76, independent conditional: 7, independent unconditional: 69, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 216, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 199, dependent conditional: 8, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 97, unknown conditional: 8, unknown unconditional: 89] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 76, Positive conditional cache size: 7, Positive unconditional cache size: 69, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 70, independent conditional: 16, independent unconditional: 54, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 82, Positive conditional cache size: 7, Positive unconditional cache size: 75, Negative cache size: 22, Negative conditional cache size: 1, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 148, independent: 110, independent conditional: 14, independent unconditional: 96, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 148, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 94, Positive conditional cache size: 7, Positive unconditional cache size: 87, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 3, independent unconditional: 51, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 109, Positive conditional cache size: 7, Positive unconditional cache size: 102, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 41 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 123, independent conditional: 71, independent unconditional: 52, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 123, independent conditional: 71, independent unconditional: 52, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 123, independent conditional: 71, independent unconditional: 52, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 8, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137, independent: 112, independent conditional: 63, independent unconditional: 49, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 11, unknown conditional: 8, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 148, Positive conditional cache size: 15, Positive unconditional cache size: 133, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 115, independent conditional: 63, independent unconditional: 52, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 115, independent conditional: 63, independent unconditional: 52, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, independent: 115, independent conditional: 63, independent unconditional: 52, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, independent: 110, independent conditional: 62, independent unconditional: 48, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 153, Positive conditional cache size: 16, Positive unconditional cache size: 137, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 36, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 60, independent conditional: 36, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 36, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 60, independent conditional: 36, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 153, Positive conditional cache size: 16, Positive unconditional cache size: 137, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 36, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 54, independent conditional: 36, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 36, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 54, independent conditional: 36, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 153, Positive conditional cache size: 16, Positive unconditional cache size: 137, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 54 PlacesBefore, 54 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 121, independent conditional: 76, independent unconditional: 45, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 121, independent conditional: 76, independent unconditional: 45, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 121, independent conditional: 76, independent unconditional: 45, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 112, independent conditional: 70, independent unconditional: 42, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 168, Positive conditional cache size: 22, Positive unconditional cache size: 146, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 56 PlacesBefore, 54 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 112, independent conditional: 70, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 112, independent conditional: 70, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, independent: 112, independent conditional: 70, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, independent: 112, independent conditional: 70, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 171, Positive conditional cache size: 22, Positive unconditional cache size: 149, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 72, independent conditional: 48, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 72, independent conditional: 48, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 72, independent conditional: 48, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 72, independent conditional: 48, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 171, Positive conditional cache size: 22, Positive unconditional cache size: 149, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 171, Positive conditional cache size: 22, Positive unconditional cache size: 149, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 58 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 21, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 21, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 21, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 14, independent conditional: 13, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 190, Positive conditional cache size: 30, Positive unconditional cache size: 160, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=-3, t2421={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=-2, t2421={7:0}, t2422={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=-1, t2421={7:0}, t2422={8:0}, t2423={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L890] 0 pthread_t t2424; [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 \read(x) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] EXPR 3 \read(x) [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=0, t2421={7:0}, t2422={8:0}, t2423={9:0}, t2424={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L859] 4 y = 1 [L768] 4 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] EXPR 2 \read(x) [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 2 \read(x) [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 \read(x) [L782] 2 __unbuffered_p0_EBX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 3 return 0; [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 1 return 0; [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L871] 4 return 0; [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 891]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 889]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 45.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 507 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1532 IncrementalHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 1 mSDtfsCounter, 1532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=13, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 2648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:44:24,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...