/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/safe012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:01:03,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:01:03,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:01:03,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:01:03,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:01:03,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:01:03,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:01:03,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:01:03,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:01:03,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:01:03,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:01:03,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:01:03,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:01:03,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:01:03,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:01:03,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:01:03,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:01:03,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:01:03,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:01:03,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:01:03,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:01:03,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:01:03,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:01:03,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:01:03,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:01:03,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:01:03,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:01:03,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:01:03,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:01:03,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:01:03,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:01:03,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:01:03,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:01:03,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:01:03,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:01:03,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:01:03,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:01:03,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:01:03,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:01:03,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:01:03,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:01:03,326 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-13 12:01:03,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:01:03,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:01:03,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:01:03,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:01:03,363 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:01:03,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:01:03,364 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:01:03,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:01:03,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:01:03,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:01:03,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:01:03,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:01:03,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:01:03,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:01:03,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:01:03,366 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:01:03,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:01:03,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:01:03,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:01:03,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:01:03,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:01:03,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:01:03,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:01:03,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:01:03,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:01:03,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:01:03,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:01:03,368 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:01:03,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 12:01:03,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:01:03,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:01:03,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:01:03,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:01:03,726 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:01:03,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2022-12-13 12:01:04,839 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:01:05,129 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:01:05,129 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2022-12-13 12:01:05,143 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24bf4a1e5/7c8283cb5e15487a8cef821985933c89/FLAG9f2f6fb87 [2022-12-13 12:01:05,158 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24bf4a1e5/7c8283cb5e15487a8cef821985933c89 [2022-12-13 12:01:05,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:01:05,161 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:01:05,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:01:05,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:01:05,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:01:05,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78dfc894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05, skipping insertion in model container [2022-12-13 12:01:05,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:01:05,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:01:05,348 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i[951,964] [2022-12-13 12:01:05,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:01:05,629 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:01:05,642 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i[951,964] [2022-12-13 12:01:05,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:05,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:05,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:01:05,738 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:01:05,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05 WrapperNode [2022-12-13 12:01:05,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:01:05,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:01:05,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:01:05,740 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:01:05,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,825 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-12-13 12:01:05,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:01:05,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:01:05,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:01:05,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:01:05,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,878 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:01:05,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:01:05,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:01:05,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:01:05,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (1/1) ... [2022-12-13 12:01:05,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:01:05,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:01:05,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:05,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:01:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:01:05,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:01:05,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:01:05,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:01:05,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:01:05,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:01:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:01:05,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:01:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:01:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:01:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:01:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:01:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:01:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:01:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:01:05,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:01:05,975 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:01:06,128 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:01:06,130 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:01:06,526 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:01:06,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:01:06,861 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:01:06,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:06 BoogieIcfgContainer [2022-12-13 12:01:06,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:01:06,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:01:06,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:01:06,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:01:06,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:01:05" (1/3) ... [2022-12-13 12:01:06,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb41bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:01:06, skipping insertion in model container [2022-12-13 12:01:06,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:05" (2/3) ... [2022-12-13 12:01:06,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb41bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:01:06, skipping insertion in model container [2022-12-13 12:01:06,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:06" (3/3) ... [2022-12-13 12:01:06,875 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2022-12-13 12:01:06,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:01:06,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:01:06,894 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:01:06,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:01:07,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 12:01:07,108 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 12:01:07,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:07,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:01:07,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 12:01:07,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-13 12:01:07,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:07,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 12:01:07,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-13 12:01:07,208 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 12:01:07,209 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:07,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:01:07,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 12:01:07,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-13 12:01:19,306 INFO L241 LiptonReduction]: Total number of compositions: 105 [2022-12-13 12:01:19,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:01:19,325 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;@1aeee930, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:01:19,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 12:01:19,330 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 12:01:19,330 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:19,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:19,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:01:19,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1956991359, now seen corresponding path program 1 times [2022-12-13 12:01:19,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:19,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112098427] [2022-12-13 12:01:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:19,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:19,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:19,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112098427] [2022-12-13 12:01:19,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112098427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:19,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:19,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:01:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225069785] [2022-12-13 12:01:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:19,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:19,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:19,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-13 12:01:19,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:19,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:19,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-13 12:01:19,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:21,829 INFO L130 PetriNetUnfolder]: 7551/11413 cut-off events. [2022-12-13 12:01:21,829 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 12:01:21,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22300 conditions, 11413 events. 7551/11413 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 80804 event pairs, 2159 based on Foata normal form. 0/6626 useless extension candidates. Maximal degree in co-relation 22289. Up to 7569 conditions per place. [2022-12-13 12:01:21,871 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 31 selfloop transitions, 2 changer transitions 52/95 dead transitions. [2022-12-13 12:01:21,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 372 flow [2022-12-13 12:01:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-12-13 12:01:21,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:01:21,884 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 127 flow. Second operand 3 states and 118 transitions. [2022-12-13 12:01:21,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 372 flow [2022-12-13 12:01:21,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 368 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:01:21,891 INFO L231 Difference]: Finished difference. Result has 66 places, 31 transitions, 72 flow [2022-12-13 12:01:21,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=66, PETRI_TRANSITIONS=31} [2022-12-13 12:01:21,897 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-12-13 12:01:21,898 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:21,898 INFO L89 Accepts]: Start accepts. Operand has 66 places, 31 transitions, 72 flow [2022-12-13 12:01:21,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:21,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:21,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 31 transitions, 72 flow [2022-12-13 12:01:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2022-12-13 12:01:21,917 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 12:01:21,917 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:21,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 77 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 12:01:21,920 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 72 flow [2022-12-13 12:01:21,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 12:01:22,074 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:22,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-13 12:01:22,077 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 72 flow [2022-12-13 12:01:22,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:22,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:22,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:22,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:01:22,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash 896401592, now seen corresponding path program 1 times [2022-12-13 12:01:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654495819] [2022-12-13 12:01:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:22,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654495819] [2022-12-13 12:01:22,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654495819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:22,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:22,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:01:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888893529] [2022-12-13 12:01:22,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:22,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:22,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:22,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2022-12-13 12:01:22,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:22,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:22,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2022-12-13 12:01:22,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:22,757 INFO L130 PetriNetUnfolder]: 1028/1764 cut-off events. [2022-12-13 12:01:22,758 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-13 12:01:22,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 1764 events. 1028/1764 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10122 event pairs, 188 based on Foata normal form. 30/1483 useless extension candidates. Maximal degree in co-relation 3434. Up to 1303 conditions per place. [2022-12-13 12:01:22,770 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 34 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2022-12-13 12:01:22,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 180 flow [2022-12-13 12:01:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 12:01:22,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2022-12-13 12:01:22,775 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 72 flow. Second operand 3 states and 67 transitions. [2022-12-13 12:01:22,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 180 flow [2022-12-13 12:01:22,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:01:22,779 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 76 flow [2022-12-13 12:01:22,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-13 12:01:22,780 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -28 predicate places. [2022-12-13 12:01:22,781 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:22,781 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 76 flow [2022-12-13 12:01:22,782 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:22,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:22,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 76 flow [2022-12-13 12:01:22,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 76 flow [2022-12-13 12:01:22,792 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 12:01:22,793 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:22,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 77 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:01:22,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 76 flow [2022-12-13 12:01:22,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-13 12:01:22,892 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:22,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 12:01:22,894 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 76 flow [2022-12-13 12:01:22,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:22,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:22,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:22,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:01:22,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2018644239, now seen corresponding path program 1 times [2022-12-13 12:01:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:22,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594717043] [2022-12-13 12:01:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:23,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:23,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594717043] [2022-12-13 12:01:23,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594717043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:23,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:23,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:01:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772527625] [2022-12-13 12:01:23,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:23,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:01:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:23,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:01:23,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:01:23,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 12:01:23,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:23,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:23,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 12:01:23,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:23,553 INFO L130 PetriNetUnfolder]: 1559/2605 cut-off events. [2022-12-13 12:01:23,554 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 12:01:23,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 2605 events. 1559/2605 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15289 event pairs, 383 based on Foata normal form. 108/2222 useless extension candidates. Maximal degree in co-relation 5309. Up to 937 conditions per place. [2022-12-13 12:01:23,567 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 36 selfloop transitions, 3 changer transitions 6/53 dead transitions. [2022-12-13 12:01:23,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 211 flow [2022-12-13 12:01:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:01:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:01:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 12:01:23,572 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2022-12-13 12:01:23,572 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 76 flow. Second operand 4 states and 82 transitions. [2022-12-13 12:01:23,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 211 flow [2022-12-13 12:01:23,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:01:23,575 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 84 flow [2022-12-13 12:01:23,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 12:01:23,576 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2022-12-13 12:01:23,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:23,576 INFO L89 Accepts]: Start accepts. Operand has 44 places, 30 transitions, 84 flow [2022-12-13 12:01:23,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:23,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:23,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 30 transitions, 84 flow [2022-12-13 12:01:23,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 84 flow [2022-12-13 12:01:23,585 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 12:01:23,585 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:01:23,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 30 events. 0/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:01:23,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 84 flow [2022-12-13 12:01:23,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-13 12:01:24,828 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:01:24,829 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1253 [2022-12-13 12:01:24,829 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 82 flow [2022-12-13 12:01:24,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:24,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:24,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:24,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:01:24,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:24,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1831407462, now seen corresponding path program 1 times [2022-12-13 12:01:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:24,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472959572] [2022-12-13 12:01:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:26,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:26,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472959572] [2022-12-13 12:01:26,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472959572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:26,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:26,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:01:26,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392168215] [2022-12-13 12:01:26,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:26,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:01:26,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:01:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:01:26,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 12:01:26,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:26,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:26,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 12:01:26,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:26,421 INFO L130 PetriNetUnfolder]: 822/1340 cut-off events. [2022-12-13 12:01:26,422 INFO L131 PetriNetUnfolder]: For 560/560 co-relation queries the response was YES. [2022-12-13 12:01:26,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3034 conditions, 1340 events. 822/1340 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6848 event pairs, 414 based on Foata normal form. 36/1103 useless extension candidates. Maximal degree in co-relation 3021. Up to 837 conditions per place. [2022-12-13 12:01:26,431 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 38 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-13 12:01:26,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 234 flow [2022-12-13 12:01:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:01:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:01:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 12:01:26,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 12:01:26,433 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 82 flow. Second operand 5 states and 87 transitions. [2022-12-13 12:01:26,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 234 flow [2022-12-13 12:01:26,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 215 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 12:01:26,458 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 116 flow [2022-12-13 12:01:26,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 12:01:26,463 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2022-12-13 12:01:26,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:26,463 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 116 flow [2022-12-13 12:01:26,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:26,465 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:26,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 116 flow [2022-12-13 12:01:26,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 116 flow [2022-12-13 12:01:26,482 INFO L130 PetriNetUnfolder]: 22/94 cut-off events. [2022-12-13 12:01:26,482 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-13 12:01:26,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 94 events. 22/94 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 424 event pairs, 11 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 171. Up to 39 conditions per place. [2022-12-13 12:01:26,484 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 116 flow [2022-12-13 12:01:26,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 12:01:26,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [701] L2-1-->L866: Formula: (let ((.cse8 (= (mod v_~y$r_buff0_thd0~0_51 256) 0))) (let ((.cse3 (= (mod v_~y$r_buff1_thd0~0_55 256) 0)) (.cse2 (= (mod v_~y$w_buff1_used~0_256 256) 0)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_271 256) 0))) (.cse10 (not .cse8)) (.cse7 (= (mod v_~y$w_buff0_used~0_272 256) 0))) (let ((.cse1 (select |v_#memory_int_245| |v_~#y~0.base_154|)) (.cse9 (not .cse7)) (.cse0 (and .cse11 .cse10)) (.cse4 (not .cse2)) (.cse6 (not .cse3))) (and (= v_~y$r_buff0_thd0~0_50 (ite .cse0 0 v_~y$r_buff0_thd0~0_51)) (= (store |v_#memory_int_245| |v_~#y~0.base_154| (store .cse1 |v_~#y~0.offset_154| |v_ULTIMATE.start_main_#t~ite33#1_33|)) |v_#memory_int_244|) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~mem31#1_43| |v_ULTIMATE.start_main_#t~mem31#1_41|))) (or (and (or (and (= (select .cse1 |v_~#y~0.offset_154|) |v_ULTIMATE.start_main_#t~mem31#1_41|) (= |v_ULTIMATE.start_main_#t~mem31#1_41| |v_ULTIMATE.start_main_#t~ite32#1_38|) (or .cse2 .cse3)) (and .cse4 (= v_~y$w_buff1~0_135 |v_ULTIMATE.start_main_#t~ite32#1_38|) .cse5 .cse6)) (or .cse7 .cse8) (= |v_ULTIMATE.start_main_#t~ite33#1_33| |v_ULTIMATE.start_main_#t~ite32#1_38|)) (and .cse5 (= |v_ULTIMATE.start_main_#t~ite32#1_38| |v_ULTIMATE.start_main_#t~ite32#1_40|) .cse9 .cse10 (= |v_ULTIMATE.start_main_#t~ite33#1_33| v_~y$w_buff0~0_147)))) (= v_~y$w_buff0_used~0_271 (ite (and .cse9 .cse10) 0 v_~y$w_buff0_used~0_272)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_255 256) 0)) .cse6) (and .cse11 (not (= (mod v_~y$r_buff0_thd0~0_50 256) 0)))) 0 v_~y$r_buff1_thd0~0_55) v_~y$r_buff1_thd0~0_54) (= (ite (or .cse0 (and .cse4 .cse6)) 0 v_~y$w_buff1_used~0_256) v_~y$w_buff1_used~0_255))))) InVars {~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_272, ~y$w_buff1~0=v_~y$w_buff1~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_147, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_40|, #memory_int=|v_#memory_int_245|, ~#y~0.base=|v_~#y~0.base_154|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_256} OutVars{~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_271, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_32|, ~y$w_buff0~0=v_~y$w_buff0~0_147, #memory_int=|v_#memory_int_244|, ~#y~0.base=|v_~#y~0.base_154|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_255} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_38|, |v_ULTIMATE.start_main_#t~mem31#1_41|, |v_ULTIMATE.start_main_#t~ite33#1_33|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:01:27,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-13 12:01:27,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:01:27,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1376 [2022-12-13 12:01:27,839 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 120 flow [2022-12-13 12:01:27,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:27,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:27,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:27,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:01:27,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash -901898232, now seen corresponding path program 1 times [2022-12-13 12:01:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:27,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776633804] [2022-12-13 12:01:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:28,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776633804] [2022-12-13 12:01:28,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776633804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:28,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:28,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209129276] [2022-12-13 12:01:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:28,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:28,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:28,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:28,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:28,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-13 12:01:28,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:28,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:28,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-13 12:01:28,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:28,445 INFO L130 PetriNetUnfolder]: 1203/1833 cut-off events. [2022-12-13 12:01:28,446 INFO L131 PetriNetUnfolder]: For 854/854 co-relation queries the response was YES. [2022-12-13 12:01:28,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4778 conditions, 1833 events. 1203/1833 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 9388 event pairs, 394 based on Foata normal form. 20/1237 useless extension candidates. Maximal degree in co-relation 4764. Up to 1768 conditions per place. [2022-12-13 12:01:28,460 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 36 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2022-12-13 12:01:28,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 271 flow [2022-12-13 12:01:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 12:01:28,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2022-12-13 12:01:28,463 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 120 flow. Second operand 3 states and 61 transitions. [2022-12-13 12:01:28,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 271 flow [2022-12-13 12:01:28,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:01:28,466 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 183 flow [2022-12-13 12:01:28,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-13 12:01:28,466 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-13 12:01:28,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:28,467 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 183 flow [2022-12-13 12:01:28,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:28,468 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:28,468 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 183 flow [2022-12-13 12:01:28,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 183 flow [2022-12-13 12:01:28,548 INFO L130 PetriNetUnfolder]: 469/810 cut-off events. [2022-12-13 12:01:28,548 INFO L131 PetriNetUnfolder]: For 94/103 co-relation queries the response was YES. [2022-12-13 12:01:28,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 810 events. 469/810 cut-off events. For 94/103 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 4611 event pairs, 181 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 1724. Up to 646 conditions per place. [2022-12-13 12:01:28,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 183 flow [2022-12-13 12:01:28,556 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 12:01:28,560 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:28,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 12:01:28,561 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 183 flow [2022-12-13 12:01:28,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:28,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:28,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:28,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:01:28,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:28,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:28,562 INFO L85 PathProgramCache]: Analyzing trace with hash -205483705, now seen corresponding path program 1 times [2022-12-13 12:01:28,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:28,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545207260] [2022-12-13 12:01:28,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:28,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:29,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:29,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545207260] [2022-12-13 12:01:29,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545207260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:29,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:29,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:01:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953511647] [2022-12-13 12:01:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:29,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:01:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:01:29,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:01:29,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 12:01:29,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:29,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:29,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 12:01:29,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:30,334 INFO L130 PetriNetUnfolder]: 1058/1693 cut-off events. [2022-12-13 12:01:30,334 INFO L131 PetriNetUnfolder]: For 1096/1151 co-relation queries the response was YES. [2022-12-13 12:01:30,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5164 conditions, 1693 events. 1058/1693 cut-off events. For 1096/1151 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 9234 event pairs, 411 based on Foata normal form. 19/1342 useless extension candidates. Maximal degree in co-relation 5148. Up to 1179 conditions per place. [2022-12-13 12:01:30,351 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 45 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2022-12-13 12:01:30,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 377 flow [2022-12-13 12:01:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:01:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:01:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-13 12:01:30,353 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-13 12:01:30,353 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 183 flow. Second operand 5 states and 84 transitions. [2022-12-13 12:01:30,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 377 flow [2022-12-13 12:01:30,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:01:30,358 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 206 flow [2022-12-13 12:01:30,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-13 12:01:30,360 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -19 predicate places. [2022-12-13 12:01:30,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:30,361 INFO L89 Accepts]: Start accepts. Operand has 50 places, 44 transitions, 206 flow [2022-12-13 12:01:30,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:30,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:30,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 206 flow [2022-12-13 12:01:30,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 206 flow [2022-12-13 12:01:30,428 INFO L130 PetriNetUnfolder]: 463/813 cut-off events. [2022-12-13 12:01:30,428 INFO L131 PetriNetUnfolder]: For 254/277 co-relation queries the response was YES. [2022-12-13 12:01:30,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 813 events. 463/813 cut-off events. For 254/277 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 4887 event pairs, 169 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 1834. Up to 646 conditions per place. [2022-12-13 12:01:30,435 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 206 flow [2022-12-13 12:01:30,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 12:01:30,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [791] L778-->L866: Formula: (let ((.cse2 (= (mod v_~y$r_buff0_thd0~0_136 256) 0))) (let ((.cse1 (not .cse2)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_556 256) 0)))) (let ((.cse3 (select |v_#memory_int_578| |v_~#y~0.base_272|)) (.cse5 (= (mod v_~y$w_buff0_used~0_558 256) 0)) (.cse0 (and .cse1 .cse4))) (and (= v_~y$r_buff0_thd0~0_135 (ite .cse0 0 v_~y$r_buff0_thd0~0_136)) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_137| |v_ULTIMATE.start_main_#t~mem31#1_135|) (= |v_ULTIMATE.start_main_#t~ite33#1_107| v_~y$w_buff0~0_329) (= |v_ULTIMATE.start_main_#t~ite32#1_134| |v_ULTIMATE.start_main_#t~ite32#1_132|) .cse1) (and .cse2 (= (select .cse3 |v_~#y~0.offset_272|) |v_ULTIMATE.start_main_#t~mem31#1_135|) (= |v_ULTIMATE.start_main_#t~ite33#1_107| |v_ULTIMATE.start_main_#t~ite32#1_132|) (= |v_ULTIMATE.start_main_#t~mem31#1_135| |v_ULTIMATE.start_main_#t~ite32#1_132|))) (= v_~y$r_buff0_thd2~0_265 1) (= v_~y$r_buff1_thd0~0_147 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_135 256) 0)) .cse4) (and (not (= (mod v_~y$w_buff1_used~0_515 256) 0)) .cse1)) 0 v_~y$r_buff0_thd0~0_136)) (= v_~y$r_buff0_thd1~0_63 v_~y$r_buff1_thd1~0_67) (= (store |v_#memory_int_578| |v_~#y~0.base_272| (store .cse3 |v_~#y~0.offset_272| |v_ULTIMATE.start_main_#t~ite33#1_107|)) |v_#memory_int_577|) (= v_~y$r_buff0_thd3~0_253 v_~y$r_buff1_thd3~0_259) (= v_~y$r_buff0_thd2~0_266 v_~y$r_buff1_thd2~0_218) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|) (= v_~y$w_buff0_used~0_556 (ite .cse1 0 1)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49| (ite .cse5 1 0)) (= (ite (or (and .cse1 (not .cse5)) .cse0) 0 v_~y$w_buff0_used~0_558) v_~y$w_buff1_used~0_515) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49| 0)) (= v_~y$w_buff1~0_298 v_~y$w_buff0~0_330) (= v_~y$w_buff0~0_329 1))))) InVars {~#y~0.offset=|v_~#y~0.offset_272|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_558, ~#y~0.base=|v_~#y~0.base_272|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_137|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_253, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_266, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_63, #memory_int=|v_#memory_int_578|} OutVars{~#y~0.offset=|v_~#y~0.offset_272|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_556, ~#y~0.base=|v_~#y~0.base_272|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_218, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_67, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_298, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_106|, ~y$w_buff0~0=v_~y$w_buff0~0_329, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_253, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_265, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_63, #memory_int=|v_#memory_int_577|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_132|, |v_ULTIMATE.start_main_#t~ite33#1_107|, |v_ULTIMATE.start_main_#t~mem31#1_135|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [627] L790-->L797: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_50 256) 0))) (let ((.cse11 (= (mod v_~y$w_buff0_used~0_194 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd2~0_43 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_189 256) 0)) (.cse6 (not (= (mod v_~y$w_buff0_used~0_193 256) 0))) (.cse1 (not .cse10))) (let ((.cse4 (and .cse6 .cse1)) (.cse2 (not .cse8)) (.cse3 (not .cse9)) (.cse5 (select |v_#memory_int_169| |v_~#y~0.base_112|)) (.cse0 (not .cse11))) (and (= v_~y$w_buff0_used~0_193 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_194)) (= v_~y$w_buff1_used~0_188 (ite (or (and .cse2 .cse3) .cse4) 0 v_~y$w_buff1_used~0_189)) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_50) v_~y$r_buff0_thd2~0_49) (= (store |v_#memory_int_169| |v_~#y~0.base_112| (store .cse5 |v_~#y~0.offset_112| |v_P1_#t~ite5#1_27|)) |v_#memory_int_168|) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse6 (not (= (mod v_~y$r_buff0_thd2~0_49 256) 0)))) 0 v_~y$r_buff1_thd2~0_43) v_~y$r_buff1_thd2~0_42) (let ((.cse7 (= |v_P1Thread1of1ForFork2_#t~mem3#1_1| |v_P1_#t~mem3#1_36|))) (or (and (or (and .cse2 (= |v_P1_#t~ite4#1_29| v_~y$w_buff1~0_82) .cse7 .cse3) (and (= (select .cse5 |v_~#y~0.offset_112|) |v_P1_#t~mem3#1_36|) (or .cse8 .cse9) (= |v_P1_#t~ite4#1_29| |v_P1_#t~mem3#1_36|))) (or .cse10 .cse11) (= |v_P1_#t~ite4#1_29| |v_P1_#t~ite5#1_27|)) (and .cse0 (= |v_P1_#t~ite5#1_27| v_~y$w_buff0~0_77) (= |v_P1_#t~ite4#1_29| |v_P1Thread1of1ForFork2_#t~ite4#1_1|) .cse1 .cse7))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_194, ~y$w_buff1~0=v_~y$w_buff1~0_82, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, #memory_int=|v_#memory_int_169|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_1|, ~#y~0.base=|v_~#y~0.base_112|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_193, ~y$w_buff1~0=v_~y$w_buff1~0_82, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, #memory_int=|v_#memory_int_168|, ~#y~0.base=|v_~#y~0.base_112|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[|v_P1_#t~ite4#1_29|, |v_P1_#t~ite5#1_27|, |v_P1_#t~mem3#1_36|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-13 12:01:31,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [791] L778-->L866: Formula: (let ((.cse2 (= (mod v_~y$r_buff0_thd0~0_136 256) 0))) (let ((.cse1 (not .cse2)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_556 256) 0)))) (let ((.cse3 (select |v_#memory_int_578| |v_~#y~0.base_272|)) (.cse5 (= (mod v_~y$w_buff0_used~0_558 256) 0)) (.cse0 (and .cse1 .cse4))) (and (= v_~y$r_buff0_thd0~0_135 (ite .cse0 0 v_~y$r_buff0_thd0~0_136)) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_137| |v_ULTIMATE.start_main_#t~mem31#1_135|) (= |v_ULTIMATE.start_main_#t~ite33#1_107| v_~y$w_buff0~0_329) (= |v_ULTIMATE.start_main_#t~ite32#1_134| |v_ULTIMATE.start_main_#t~ite32#1_132|) .cse1) (and .cse2 (= (select .cse3 |v_~#y~0.offset_272|) |v_ULTIMATE.start_main_#t~mem31#1_135|) (= |v_ULTIMATE.start_main_#t~ite33#1_107| |v_ULTIMATE.start_main_#t~ite32#1_132|) (= |v_ULTIMATE.start_main_#t~mem31#1_135| |v_ULTIMATE.start_main_#t~ite32#1_132|))) (= v_~y$r_buff0_thd2~0_265 1) (= v_~y$r_buff1_thd0~0_147 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_135 256) 0)) .cse4) (and (not (= (mod v_~y$w_buff1_used~0_515 256) 0)) .cse1)) 0 v_~y$r_buff0_thd0~0_136)) (= v_~y$r_buff0_thd1~0_63 v_~y$r_buff1_thd1~0_67) (= (store |v_#memory_int_578| |v_~#y~0.base_272| (store .cse3 |v_~#y~0.offset_272| |v_ULTIMATE.start_main_#t~ite33#1_107|)) |v_#memory_int_577|) (= v_~y$r_buff0_thd3~0_253 v_~y$r_buff1_thd3~0_259) (= v_~y$r_buff0_thd2~0_266 v_~y$r_buff1_thd2~0_218) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|) (= v_~y$w_buff0_used~0_556 (ite .cse1 0 1)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49| (ite .cse5 1 0)) (= (ite (or (and .cse1 (not .cse5)) .cse0) 0 v_~y$w_buff0_used~0_558) v_~y$w_buff1_used~0_515) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49| 0)) (= v_~y$w_buff1~0_298 v_~y$w_buff0~0_330) (= v_~y$w_buff0~0_329 1))))) InVars {~#y~0.offset=|v_~#y~0.offset_272|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_558, ~#y~0.base=|v_~#y~0.base_272|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_137|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_253, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_266, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_63, #memory_int=|v_#memory_int_578|} OutVars{~#y~0.offset=|v_~#y~0.offset_272|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_556, ~#y~0.base=|v_~#y~0.base_272|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_218, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_67, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_298, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_106|, ~y$w_buff0~0=v_~y$w_buff0~0_329, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_253, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_265, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_63, #memory_int=|v_#memory_int_577|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_132|, |v_ULTIMATE.start_main_#t~ite33#1_107|, |v_ULTIMATE.start_main_#t~mem31#1_135|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-13 12:01:32,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] L855-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_Out_2|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [794] L778-->L833: Formula: (let ((.cse11 (= (mod v_~y$r_buff0_thd0~0_146 256) 0))) (let ((.cse9 (not .cse11))) (let ((.cse3 (ite .cse9 0 1))) (let ((.cse12 (= (mod .cse3 256) 0))) (let ((.cse2 (not .cse12))) (let ((.cse0 (and .cse9 .cse2)) (.cse5 (= (mod v_~y$w_buff0_used~0_576 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_262 256) 0))) (let ((.cse1 (not .cse13)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_574 256) 0))) (.cse8 (ite (or .cse0 (and .cse9 (not .cse5))) 0 v_~y$w_buff0_used~0_576))) (let ((.cse7 (not (= (mod .cse8 256) 0))) (.cse10 (select |v_#memory_int_595| |v_~#y~0.base_278|)) (.cse6 (and .cse1 .cse4))) (and (= v_~y$r_buff0_thd0~0_145 (ite .cse0 0 v_~y$r_buff0_thd0~0_146)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55|) (= v_~y$w_buff0_used~0_574 (ite (and .cse1 .cse2) 0 .cse3)) (= v_~y$r_buff0_thd2~0_279 1) (= v_~y$w_buff1~0_304 v_~y$w_buff0~0_342) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_527 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_261 256) 0)) .cse4)) 0 v_~y$r_buff0_thd3~0_262) v_~y$r_buff1_thd3~0_267) (= (ite .cse5 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55|) (= v_~y$r_buff0_thd1~0_69 v_~y$r_buff1_thd1~0_73) (= v_~y$r_buff0_thd2~0_280 v_~y$r_buff1_thd2~0_226) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55| 0)) (= v_~y$w_buff1_used~0_527 (ite (or .cse6 (and .cse7 .cse1)) 0 .cse8)) (= v_~y$r_buff1_thd0~0_155 (ite (or (and .cse7 .cse9) (and (not (= (mod v_~y$r_buff0_thd0~0_145 256) 0)) .cse2)) 0 v_~y$r_buff0_thd0~0_146)) (= (store |v_#memory_int_595| |v_~#y~0.base_278| (store .cse10 |v_~#y~0.offset_278| |v_P2_#t~ite24_52|)) |v_#memory_int_593|) (or (and .cse9 (= |v_ULTIMATE.start_main_#t~ite32#1_148| |v_ULTIMATE.start_main_#t~ite32#1_146|) (= |v_ULTIMATE.start_main_#t~mem31#1_149| |v_ULTIMATE.start_main_#t~mem31#1_151|) (= |v_ULTIMATE.start_main_#t~ite33#1_117| v_~y$w_buff0~0_341)) (and .cse11 (= |v_ULTIMATE.start_main_#t~mem31#1_149| |v_ULTIMATE.start_main_#t~ite32#1_146|) (= |v_ULTIMATE.start_main_#t~mem31#1_149| (select .cse10 |v_~#y~0.offset_278|)) (= |v_ULTIMATE.start_main_#t~ite33#1_117| |v_ULTIMATE.start_main_#t~ite32#1_146|))) (or (and (= |v_P2_#t~ite24_52| |v_P2_#t~ite23_52|) (= |v_P2_#t~ite23_52| |v_P2_#t~mem22_57|) (= |v_ULTIMATE.start_main_#t~ite33#1_117| |v_P2_#t~mem22_57|) (or .cse12 .cse13)) (and (= |v_P2_#t~ite23_52| |v_P2Thread1of1ForFork0_#t~ite23_50|) .cse1 (= |v_P2_#t~ite24_52| v_~y$w_buff0~0_341) .cse2 (= |v_P2Thread1of1ForFork0_#t~mem22_50| |v_P2_#t~mem22_57|))) (= v_~y$w_buff0~0_341 1) (= (ite .cse6 0 v_~y$r_buff0_thd3~0_262) v_~y$r_buff0_thd3~0_261)))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_278|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_576, ~#y~0.base=|v_~#y~0.base_278|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_151|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_262, ~y$w_buff0~0=v_~y$w_buff0~0_342, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_50|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_280, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_69, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_148|, #memory_int=|v_#memory_int_595|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_50|} OutVars{~#y~0.offset=|v_~#y~0.offset_278|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_574, ~#y~0.base=|v_~#y~0.base_278|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_226, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_267, ~y$w_buff1~0=v_~y$w_buff1~0_304, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_261, ~y$w_buff0~0=v_~y$w_buff0~0_341, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_145, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_116|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_27|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_279, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_69, #memory_int=|v_#memory_int_593|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_527} AuxVars[|v_P2_#t~ite24_52|, |v_ULTIMATE.start_main_#t~ite32#1_146|, |v_ULTIMATE.start_main_#t~mem31#1_149|, |v_P2_#t~ite23_52|, |v_ULTIMATE.start_main_#t~ite33#1_117|, |v_P2_#t~mem22_57|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32#1, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:01:33,559 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:01:33,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3200 [2022-12-13 12:01:33,560 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 209 flow [2022-12-13 12:01:33,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:33,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:33,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:33,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:01:33,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1850062714, now seen corresponding path program 1 times [2022-12-13 12:01:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:33,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683350860] [2022-12-13 12:01:33,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:33,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:33,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683350860] [2022-12-13 12:01:33,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683350860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:33,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:33,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:01:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95545599] [2022-12-13 12:01:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:33,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:33,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-13 12:01:33,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:33,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:33,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-13 12:01:33,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:33,963 INFO L130 PetriNetUnfolder]: 639/1119 cut-off events. [2022-12-13 12:01:33,963 INFO L131 PetriNetUnfolder]: For 1189/1213 co-relation queries the response was YES. [2022-12-13 12:01:33,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3785 conditions, 1119 events. 639/1119 cut-off events. For 1189/1213 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6163 event pairs, 70 based on Foata normal form. 70/825 useless extension candidates. Maximal degree in co-relation 3767. Up to 901 conditions per place. [2022-12-13 12:01:33,972 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 41 selfloop transitions, 19 changer transitions 0/65 dead transitions. [2022-12-13 12:01:33,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 422 flow [2022-12-13 12:01:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:01:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:01:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-13 12:01:33,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-13 12:01:33,974 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 209 flow. Second operand 4 states and 81 transitions. [2022-12-13 12:01:33,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 422 flow [2022-12-13 12:01:33,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 388 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 12:01:33,980 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 285 flow [2022-12-13 12:01:33,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2022-12-13 12:01:33,981 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -20 predicate places. [2022-12-13 12:01:33,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:33,982 INFO L89 Accepts]: Start accepts. Operand has 49 places, 51 transitions, 285 flow [2022-12-13 12:01:33,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:33,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:33,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 285 flow [2022-12-13 12:01:33,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 285 flow [2022-12-13 12:01:34,047 INFO L130 PetriNetUnfolder]: 283/597 cut-off events. [2022-12-13 12:01:34,048 INFO L131 PetriNetUnfolder]: For 112/130 co-relation queries the response was YES. [2022-12-13 12:01:34,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 597 events. 283/597 cut-off events. For 112/130 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3823 event pairs, 28 based on Foata normal form. 2/366 useless extension candidates. Maximal degree in co-relation 1805. Up to 391 conditions per place. [2022-12-13 12:01:34,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 285 flow [2022-12-13 12:01:34,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 12:01:34,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] L855-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_Out_2|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [793] L778-->L797: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd0~0_142 256) 0))) (let ((.cse5 (not .cse6))) (let ((.cse9 (ite .cse5 0 1))) (let ((.cse11 (= (mod .cse9 256) 0))) (let ((.cse8 (not .cse11))) (let ((.cse7 (and .cse8 .cse5)) (.cse10 (= (mod v_~y$w_buff0_used~0_570 256) 0))) (let ((.cse4 (ite (or .cse7 (and .cse5 (not .cse10))) 0 v_~y$w_buff0_used~0_570))) (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_568 256) 0))) (.cse3 (not (= (mod v_~y$r_buff0_thd2~0_275 256) 0))) (.cse1 (select |v_#memory_int_589| |v_~#y~0.base_276|)) (.cse2 (not (= (mod .cse4 256) 0)))) (and (= v_~y$r_buff0_thd2~0_273 (ite .cse0 0 1)) (= (store |v_#memory_int_589| |v_~#y~0.base_276| (store .cse1 |v_~#y~0.offset_276| |v_P1_#t~ite5#1_89|)) |v_#memory_int_587|) (= v_~y$w_buff1_used~0_523 (ite (or .cse0 (and .cse2 .cse3)) 0 .cse4)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|) (= v_~y$r_buff1_thd2~0_222 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_273 256) 0)) .cse0) (and (not (= (mod v_~y$w_buff1_used~0_523 256) 0)) .cse3)) 0 v_~y$r_buff0_thd2~0_275)) (= v_~y$r_buff0_thd1~0_67 v_~y$r_buff1_thd1~0_71) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_145| |v_ULTIMATE.start_main_#t~mem31#1_143|) .cse5 (= |v_ULTIMATE.start_main_#t~ite32#1_142| |v_ULTIMATE.start_main_#t~ite32#1_140|) (= |v_ULTIMATE.start_main_#t~ite33#1_113| v_~y$w_buff0~0_337)) (and .cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_143| |v_ULTIMATE.start_main_#t~ite32#1_140|) (= |v_ULTIMATE.start_main_#t~mem31#1_143| (select .cse1 |v_~#y~0.offset_276|)) (= |v_ULTIMATE.start_main_#t~ite33#1_113| |v_ULTIMATE.start_main_#t~ite32#1_140|))) (= v_~y$w_buff1~0_302 v_~y$w_buff0~0_338) (= v_~y$r_buff0_thd0~0_141 (ite .cse7 0 v_~y$r_buff0_thd0~0_142)) (= v_~y$w_buff0~0_337 1) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53| 0)) (= v_~y$w_buff0_used~0_568 (ite .cse8 0 .cse9)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53| (ite .cse10 1 0)) (or (and .cse8 (= |v_P1_#t~ite4#1_91| |v_P1Thread1of1ForFork2_#t~ite4#1_122|) (= |v_P1Thread1of1ForFork2_#t~mem3#1_122| |v_P1_#t~mem3#1_98|) (= |v_P1_#t~ite5#1_89| v_~y$w_buff0~0_337)) (and .cse11 (= |v_P1_#t~ite4#1_91| |v_P1_#t~mem3#1_98|) (= |v_P1_#t~ite4#1_91| |v_P1_#t~ite5#1_89|) (= |v_ULTIMATE.start_main_#t~ite33#1_113| |v_P1_#t~mem3#1_98|))) (= v_~y$r_buff0_thd3~0_259 v_~y$r_buff1_thd3~0_265) (= v_~y$r_buff1_thd0~0_153 (ite (or (and .cse5 .cse2) (and .cse8 (not (= (mod v_~y$r_buff0_thd0~0_141 256) 0)))) 0 v_~y$r_buff0_thd0~0_142))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_276|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_570, ~#y~0.base=|v_~#y~0.base_276|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_145|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_259, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_275, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_67, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_142|, #memory_int=|v_#memory_int_589|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_122|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_122|} OutVars{~#y~0.offset=|v_~#y~0.offset_276|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_568, ~#y~0.base=|v_~#y~0.base_276|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_222, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_71, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_265, ~y$w_buff1~0=v_~y$w_buff1~0_302, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_63|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53|, ~y$w_buff0~0=v_~y$w_buff0~0_337, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_141, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_112|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_259, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_273, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_67, #memory_int=|v_#memory_int_587|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_523} AuxVars[|v_P1_#t~ite5#1_89|, |v_ULTIMATE.start_main_#t~ite33#1_113|, |v_P1_#t~ite4#1_91|, |v_P1_#t~mem3#1_98|, |v_ULTIMATE.start_main_#t~mem31#1_143|, |v_ULTIMATE.start_main_#t~ite32#1_140|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2_#t~ite5#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32#1, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-13 12:01:34,888 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:01:34,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 911 [2022-12-13 12:01:34,892 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 289 flow [2022-12-13 12:01:34,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:34,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:34,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:34,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:01:34,893 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1402488374, now seen corresponding path program 1 times [2022-12-13 12:01:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:34,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012452206] [2022-12-13 12:01:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:35,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012452206] [2022-12-13 12:01:35,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012452206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:35,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:35,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:01:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865594399] [2022-12-13 12:01:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:35,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:01:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:35,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:01:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:01:35,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-13 12:01:35,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:35,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:35,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-13 12:01:35,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:35,292 INFO L130 PetriNetUnfolder]: 279/570 cut-off events. [2022-12-13 12:01:35,293 INFO L131 PetriNetUnfolder]: For 398/458 co-relation queries the response was YES. [2022-12-13 12:01:35,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 570 events. 279/570 cut-off events. For 398/458 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2937 event pairs, 16 based on Foata normal form. 89/457 useless extension candidates. Maximal degree in co-relation 2217. Up to 322 conditions per place. [2022-12-13 12:01:35,297 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 31 selfloop transitions, 28 changer transitions 0/64 dead transitions. [2022-12-13 12:01:35,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 454 flow [2022-12-13 12:01:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:01:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:01:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-13 12:01:35,299 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 12:01:35,299 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 289 flow. Second operand 5 states and 85 transitions. [2022-12-13 12:01:35,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 454 flow [2022-12-13 12:01:35,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 398 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 12:01:35,305 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 302 flow [2022-12-13 12:01:35,305 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2022-12-13 12:01:35,306 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -19 predicate places. [2022-12-13 12:01:35,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:35,307 INFO L89 Accepts]: Start accepts. Operand has 50 places, 50 transitions, 302 flow [2022-12-13 12:01:35,308 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:35,308 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:35,308 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 50 transitions, 302 flow [2022-12-13 12:01:35,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 302 flow [2022-12-13 12:01:35,337 INFO L130 PetriNetUnfolder]: 121/318 cut-off events. [2022-12-13 12:01:35,338 INFO L131 PetriNetUnfolder]: For 99/111 co-relation queries the response was YES. [2022-12-13 12:01:35,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 318 events. 121/318 cut-off events. For 99/111 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1865 event pairs, 1 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 1020. Up to 217 conditions per place. [2022-12-13 12:01:35,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 50 transitions, 302 flow [2022-12-13 12:01:35,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 12:01:37,138 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:01:37,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1836 [2022-12-13 12:01:37,142 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 296 flow [2022-12-13 12:01:37,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:37,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:37,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:37,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:01:37,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash -904626639, now seen corresponding path program 1 times [2022-12-13 12:01:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:37,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297313116] [2022-12-13 12:01:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:37,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:37,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297313116] [2022-12-13 12:01:37,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297313116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:37,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:37,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:01:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626968541] [2022-12-13 12:01:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:37,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:37,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:37,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:37,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:37,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2022-12-13 12:01:37,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:37,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:37,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2022-12-13 12:01:37,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:37,496 INFO L130 PetriNetUnfolder]: 380/708 cut-off events. [2022-12-13 12:01:37,497 INFO L131 PetriNetUnfolder]: For 936/970 co-relation queries the response was YES. [2022-12-13 12:01:37,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2915 conditions, 708 events. 380/708 cut-off events. For 936/970 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 3933 event pairs, 17 based on Foata normal form. 46/578 useless extension candidates. Maximal degree in co-relation 2898. Up to 432 conditions per place. [2022-12-13 12:01:37,501 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 40 selfloop transitions, 1 changer transitions 30/82 dead transitions. [2022-12-13 12:01:37,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 677 flow [2022-12-13 12:01:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:01:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:01:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-13 12:01:37,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2022-12-13 12:01:37,503 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 296 flow. Second operand 4 states and 69 transitions. [2022-12-13 12:01:37,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 677 flow [2022-12-13 12:01:37,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 543 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 12:01:37,510 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 216 flow [2022-12-13 12:01:37,510 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2022-12-13 12:01:37,511 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -20 predicate places. [2022-12-13 12:01:37,511 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:37,511 INFO L89 Accepts]: Start accepts. Operand has 49 places, 43 transitions, 216 flow [2022-12-13 12:01:37,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:37,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:37,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 43 transitions, 216 flow [2022-12-13 12:01:37,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 43 transitions, 216 flow [2022-12-13 12:01:37,542 INFO L130 PetriNetUnfolder]: 112/263 cut-off events. [2022-12-13 12:01:37,542 INFO L131 PetriNetUnfolder]: For 217/218 co-relation queries the response was YES. [2022-12-13 12:01:37,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 263 events. 112/263 cut-off events. For 217/218 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1521 event pairs, 2 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 737. Up to 136 conditions per place. [2022-12-13 12:01:37,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 43 transitions, 216 flow [2022-12-13 12:01:37,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-13 12:01:37,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [801] $Ultimate##0-->L833: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd3~0_274 256) 0))) (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_600 256) 0))) (.cse1 (not .cse5))) (let ((.cse4 (select |v_#memory_int_620| |v_~#y~0.base_290|)) (.cse2 (= (mod v_~y$w_buff0_used~0_601 256) 0)) (.cse3 (and .cse0 .cse1))) (and (= v_~x~0_54 1) (= v_~y$r_buff0_thd2~0_296 v_~y$r_buff1_thd2~0_234) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_273 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_545 256) 0)))) 0 v_~y$r_buff0_thd3~0_274) v_~y$r_buff1_thd3~0_277) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63|) (= (ite .cse3 0 v_~y$r_buff0_thd3~0_274) v_~y$r_buff0_thd3~0_273) (= (store |v_#memory_int_620| |v_~#y~0.base_290| (store .cse4 |v_~#y~0.offset_290| |v_P2_#t~ite24_59|)) |v_#memory_int_619|) (= v_~y$r_buff0_thd1~0_77 v_~y$r_buff1_thd1~0_81) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|) (= v_~y$r_buff0_thd0~0_167 v_~y$r_buff1_thd0~0_171) (or (and (= (select .cse4 |v_~#y~0.offset_290|) |v_P2_#t~mem22_64|) (= |v_P2_#t~ite24_59| |v_P2_#t~ite23_59|) (= |v_P2_#t~ite23_59| |v_P2_#t~mem22_64|) .cse5) (and (= |v_P2_#t~ite24_59| v_~y$w_buff0~0_361) .cse1 (= |v_P2Thread1of1ForFork0_#t~mem22_58| |v_P2_#t~mem22_64|) (= |v_P2_#t~ite23_59| |v_P2Thread1of1ForFork0_#t~ite23_58|))) (= v_~y$w_buff0~0_361 1) (= v_~y$r_buff0_thd2~0_295 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_21| |v_P1Thread1of1ForFork2_~arg#1.offset_21|) (= v_~y$w_buff1~0_316 v_~y$w_buff0~0_362) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_21| |v_P1Thread1of1ForFork2_~arg#1.base_21|) (= v_~y$w_buff1_used~0_545 (ite (or (and .cse1 (not .cse2)) .cse3) 0 v_~y$w_buff0_used~0_601)) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63| 0)) (= (ite .cse1 0 1) v_~y$w_buff0_used~0_600))))) InVars {~#y~0.offset=|v_~#y~0.offset_290|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_601, ~#y~0.base=|v_~#y~0.base_290|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_274, ~y$w_buff0~0=v_~y$w_buff0~0_362, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_167, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_58|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_296, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_77, #memory_int=|v_#memory_int_620|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_58|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_21|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_21|, ~#y~0.offset=|v_~#y~0.offset_290|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_600, ~#y~0.base=|v_~#y~0.base_290|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_21|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_81, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_277, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_273, ~y$w_buff0~0=v_~y$w_buff0~0_361, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_31|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_77, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_21|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_21|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_234, ~y$w_buff1~0=v_~y$w_buff1~0_316, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_167, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_295, #memory_int=|v_#memory_int_619|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_171, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_545} AuxVars[|v_P2_#t~ite24_59|, |v_P2_#t~ite23_59|, |v_P2_#t~mem22_64|] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$r_buff0_thd2~0, #memory_int, P2Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] and [627] L790-->L797: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_50 256) 0))) (let ((.cse11 (= (mod v_~y$w_buff0_used~0_194 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd2~0_43 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_189 256) 0)) (.cse6 (not (= (mod v_~y$w_buff0_used~0_193 256) 0))) (.cse1 (not .cse10))) (let ((.cse4 (and .cse6 .cse1)) (.cse2 (not .cse8)) (.cse3 (not .cse9)) (.cse5 (select |v_#memory_int_169| |v_~#y~0.base_112|)) (.cse0 (not .cse11))) (and (= v_~y$w_buff0_used~0_193 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_194)) (= v_~y$w_buff1_used~0_188 (ite (or (and .cse2 .cse3) .cse4) 0 v_~y$w_buff1_used~0_189)) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_50) v_~y$r_buff0_thd2~0_49) (= (store |v_#memory_int_169| |v_~#y~0.base_112| (store .cse5 |v_~#y~0.offset_112| |v_P1_#t~ite5#1_27|)) |v_#memory_int_168|) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse6 (not (= (mod v_~y$r_buff0_thd2~0_49 256) 0)))) 0 v_~y$r_buff1_thd2~0_43) v_~y$r_buff1_thd2~0_42) (let ((.cse7 (= |v_P1Thread1of1ForFork2_#t~mem3#1_1| |v_P1_#t~mem3#1_36|))) (or (and (or (and .cse2 (= |v_P1_#t~ite4#1_29| v_~y$w_buff1~0_82) .cse7 .cse3) (and (= (select .cse5 |v_~#y~0.offset_112|) |v_P1_#t~mem3#1_36|) (or .cse8 .cse9) (= |v_P1_#t~ite4#1_29| |v_P1_#t~mem3#1_36|))) (or .cse10 .cse11) (= |v_P1_#t~ite4#1_29| |v_P1_#t~ite5#1_27|)) (and .cse0 (= |v_P1_#t~ite5#1_27| v_~y$w_buff0~0_77) (= |v_P1_#t~ite4#1_29| |v_P1Thread1of1ForFork2_#t~ite4#1_1|) .cse1 .cse7))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_194, ~y$w_buff1~0=v_~y$w_buff1~0_82, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, #memory_int=|v_#memory_int_169|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_1|, ~#y~0.base=|v_~#y~0.base_112|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_193, ~y$w_buff1~0=v_~y$w_buff1~0_82, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, #memory_int=|v_#memory_int_168|, ~#y~0.base=|v_~#y~0.base_112|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[|v_P1_#t~ite4#1_29|, |v_P1_#t~ite5#1_27|, |v_P1_#t~mem3#1_36|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-13 12:01:39,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->L826: Formula: (let ((.cse9 (mod v_~y$w_buff0_used~0_547 256)) (.cse4 (= (mod v_~y$r_buff0_thd3~0_248 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_546 256) 0)) (.cse16 (mod v_~weak$$choice0~0_123 256))) (let ((.cse24 (= .cse16 0)) (.cse25 (= 0 (mod v_~weak$$choice2~0_96 256))) (.cse23 (= (mod v_~y$w_buff1_used~0_508 256) 0)) (.cse3 (not .cse1)) (.cse12 (not .cse4)) (.cse7 (select |v_#memory_int_568| |v_~#y~0.base_268|)) (.cse10 (= .cse9 0))) (let ((.cse11 (not .cse10)) (.cse8 (select .cse7 |v_~#y~0.offset_268|)) (.cse14 (= (mod v_~weak$$choice1~0_226 256) 0)) (.cse2 (and .cse3 .cse12)) (.cse13 (not .cse23)) (.cse0 (not .cse25)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_254 256) 0)) (.cse6 (not (= (mod v_~y$w_buff1_used~0_507 256) 0))) (.cse15 (not .cse24))) (and (= 0 v_~y$flush_delayed~0_84) (= (ite .cse0 v_~y$r_buff0_thd3~0_248 (ite .cse1 v_~y$r_buff0_thd3~0_248 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~y$r_buff0_thd3~0_248 0)))) v_~y$r_buff0_thd3~0_247) (= (store |v_#memory_int_568| |v_~#y~0.base_268| (store .cse7 |v_~#y~0.offset_268| |v_P2_#t~ite21_59|)) |v_#memory_int_567|) (= v_~y$mem_tmp~0_60 .cse8) (= (ite (= (ite .cse0 .cse9 (ite .cse10 .cse9 (ite (and .cse11 .cse12) 0 (ite (and .cse11 .cse13 .cse4 .cse5) (ite (or .cse14 .cse15) 1 0) .cse16)))) 0) 0 1) v_~y$w_buff0_used~0_546) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_168 |v_~#y~0.base_268|) (= v_~weak$$choice2~0_96 |v_P2Thread1of1ForFork0_#t~nondet7_62|) (= v_~__unbuffered_p2_EAX$read_delayed~0_165 1) (= v_~weak$$choice1~0_226 |v_P2Thread1of1ForFork0_#t~nondet9_62|) (= |v_~#y~0.offset_268| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_168) (= v_~y$w_buff1~0_293 v_~y$w_buff1~0_292) (let ((.cse19 (= |v_P2_#t~ite16_77| |v_P2Thread1of1ForFork0_#t~ite16_62|)) (.cse21 (= |v_P2_#t~ite12_83| |v_P2Thread1of1ForFork0_#t~ite12_62|)) (.cse17 (= |v_P2Thread1of1ForFork0_#t~mem11_62| |v_P2_#t~mem11_84|)) (.cse18 (= |v_P2_#t~ite15_79| |v_P2Thread1of1ForFork0_#t~ite15_62|)) (.cse20 (= |v_P2_#t~ite14_97| |v_P2Thread1of1ForFork0_#t~ite14_62|)) (.cse22 (= |v_P2Thread1of1ForFork0_#t~mem13_62| |v_P2_#t~mem13_100|))) (or (and (= |v_P2_#t~mem10_64| v_~__unbuffered_p2_EAX~0_287) .cse10 .cse17 (= .cse8 |v_P2_#t~mem10_64|) .cse18 .cse19 .cse20 (= |v_P2_#t~ite17_67| |v_P2Thread1of1ForFork0_#t~ite17_61|) .cse21 .cse22) (and (= |v_P2Thread1of1ForFork0_#t~mem10_62| |v_P2_#t~mem10_64|) .cse11 (or (and .cse17 (= |v_P2_#t~ite17_67| v_~y$w_buff0~0_322) .cse18 .cse19 .cse20 .cse21 .cse22 .cse12) (and (= |v_P2_#t~ite16_77| |v_P2_#t~ite17_67|) .cse4 (or (and (or .cse23 (not .cse5)) .cse17 (or (and (= |v_P2_#t~ite15_79| (ite .cse15 v_~y$w_buff1~0_293 v_~y$w_buff0~0_322)) .cse13 .cse20 .cse22) (and (= |v_P2_#t~ite15_79| |v_P2_#t~ite14_97|) .cse23 (or (and (= |v_P2_#t~ite14_97| v_~y$w_buff0~0_322) .cse15 .cse22) (and (= .cse8 |v_P2_#t~mem13_100|) .cse24 (= |v_P2_#t~ite14_97| |v_P2_#t~mem13_100|))))) (= |v_P2_#t~ite15_79| |v_P2_#t~ite16_77|) .cse21) (and (or (and .cse15 (= .cse8 |v_P2_#t~mem11_84|) (= |v_P2_#t~ite12_83| |v_P2_#t~mem11_84|)) (and .cse24 (= |v_P2_#t~ite12_83| (ite (not .cse14) v_~y$w_buff0~0_322 v_~y$w_buff1~0_293)) .cse17)) .cse18 .cse13 .cse20 .cse5 (= |v_P2_#t~ite16_77| |v_P2_#t~ite12_83|) .cse22)))) (= |v_P2_#t~ite17_67| v_~__unbuffered_p2_EAX~0_287)))) (or (and (= |v_P2Thread1of1ForFork0_#t~mem20_62| |v_P2_#t~mem20_64|) .cse0 (= |v_P2_#t~ite21_59| v_~y$mem_tmp~0_60)) (and (= |v_P2_#t~ite21_59| |v_P2_#t~mem20_64|) .cse25 (= |v_P2_#t~mem20_64| v_~__unbuffered_p2_EAX~0_287))) (= v_~y$w_buff1_used~0_507 (ite .cse0 v_~y$w_buff1_used~0_508 (ite .cse1 v_~y$w_buff1_used~0_508 (ite .cse2 0 (ite (and .cse3 .cse13 .cse4 .cse5) v_~weak$$choice0~0_123 0))))) (= |v_P2Thread1of1ForFork0_#in~arg.base_33| v_P2Thread1of1ForFork0_~arg.base_33) (= (ite .cse0 v_~y$r_buff1_thd3~0_254 (ite .cse1 v_~y$r_buff1_thd3~0_254 (let ((.cse26 (= (mod v_~y$r_buff0_thd3~0_247 256) 0))) (ite (and .cse3 (not .cse26)) 0 (ite (and .cse3 .cse26 .cse5 .cse6) (ite .cse15 v_~y$r_buff1_thd3~0_254 0) 0))))) v_~y$r_buff1_thd3~0_253) (= v_~y$w_buff0~0_322 v_~y$w_buff0~0_321) (= v_~z~0_47 1) (= v_~weak$$choice0~0_123 |v_P2Thread1of1ForFork0_#t~nondet6_62|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_33| v_P2Thread1of1ForFork0_~arg.offset_33))))) InVars {~#y~0.offset=|v_~#y~0.offset_268|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_547, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_62|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_62|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_62|, ~#y~0.base=|v_~#y~0.base_268|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_62|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_62|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_62|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_254, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_61|, ~y$w_buff1~0=v_~y$w_buff1~0_293, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_248, ~y$w_buff0~0=v_~y$w_buff0~0_322, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_62|, #memory_int=|v_#memory_int_568|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_62|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_62|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_62|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_508, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_62|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_33|, ~#y~0.offset=|v_~#y~0.offset_268|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_546, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_168, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_168, ~#y~0.base=|v_~#y~0.base_268|, ~y$mem_tmp~0=v_~y$mem_tmp~0_60, ~weak$$choice1~0=v_~weak$$choice1~0_226, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_253, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_33|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_247, ~y$w_buff0~0=v_~y$w_buff0~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_84, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_287, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_33|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_33, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_165, ~weak$$choice0~0=v_~weak$$choice0~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_292, #memory_int=|v_#memory_int_567|, ~z~0=v_~z~0_47, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_33|, ~weak$$choice2~0=v_~weak$$choice2~0_96, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_507} AuxVars[|v_P2_#t~mem11_84|, |v_P2_#t~mem13_100|, |v_P2_#t~ite21_59|, |v_P2_#t~mem10_64|, |v_P2_#t~ite15_79|, |v_P2_#t~ite17_67|, |v_P2_#t~mem20_64|, |v_P2_#t~ite16_77|, |v_P2_#t~ite12_83|, |v_P2_#t~ite14_97|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [797] $Ultimate##0-->L766: Formula: (and (= v_~z~0_49 v_~__unbuffered_p0_EAX~0_141) (= v_~__unbuffered_p0_EBX~0_139 v_~x~0_44) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~z~0=v_~z~0_49, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_44} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_141, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_139, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~z~0=v_~z~0_49, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_44, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-13 12:01:43,533 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:01:43,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6023 [2022-12-13 12:01:43,534 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 232 flow [2022-12-13 12:01:43,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:43,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:43,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:43,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:01:43,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:01:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash -515571216, now seen corresponding path program 1 times [2022-12-13 12:01:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:43,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812827359] [2022-12-13 12:01:43,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:01:43,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:01:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:01:43,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:01:43,693 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:01:43,694 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 12:01:43,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 12:01:43,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 12:01:43,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 12:01:43,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 12:01:43,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 12:01:43,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:01:43,699 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:43,704 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:01:43,704 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:01:43,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:01:43 BasicIcfg [2022-12-13 12:01:43,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:01:43,794 INFO L158 Benchmark]: Toolchain (without parser) took 38633.21ms. Allocated memory was 177.2MB in the beginning and 954.2MB in the end (delta: 777.0MB). Free memory was 151.9MB in the beginning and 500.1MB in the end (delta: -348.2MB). Peak memory consumption was 429.5MB. Max. memory is 8.0GB. [2022-12-13 12:01:43,794 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory was 154.5MB in the beginning and 154.4MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:01:43,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.20ms. Allocated memory is still 177.2MB. Free memory was 151.9MB in the beginning and 124.8MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 12:01:43,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.31ms. Allocated memory is still 177.2MB. Free memory was 124.3MB in the beginning and 121.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:01:43,801 INFO L158 Benchmark]: Boogie Preprocessor took 56.37ms. Allocated memory is still 177.2MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:01:43,801 INFO L158 Benchmark]: RCFGBuilder took 981.87ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 119.6MB in the beginning and 155.8MB in the end (delta: -36.3MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. [2022-12-13 12:01:43,801 INFO L158 Benchmark]: TraceAbstraction took 36926.29ms. Allocated memory was 212.9MB in the beginning and 954.2MB in the end (delta: 741.3MB). Free memory was 154.8MB in the beginning and 500.1MB in the end (delta: -345.3MB). Peak memory consumption was 395.5MB. Max. memory is 8.0GB. [2022-12-13 12:01:43,803 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.14ms. Allocated memory is still 177.2MB. Free memory was 154.5MB in the beginning and 154.4MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 577.20ms. Allocated memory is still 177.2MB. Free memory was 151.9MB in the beginning and 124.8MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.31ms. Allocated memory is still 177.2MB. Free memory was 124.3MB in the beginning and 121.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.37ms. Allocated memory is still 177.2MB. Free memory was 121.7MB in the beginning and 119.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 981.87ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 119.6MB in the beginning and 155.8MB in the end (delta: -36.3MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. * TraceAbstraction took 36926.29ms. Allocated memory was 212.9MB in the beginning and 954.2MB in the end (delta: 741.3MB). Free memory was 154.8MB in the beginning and 500.1MB in the end (delta: -345.3MB). Peak memory consumption was 395.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.1s, 132 PlacesBefore, 69 PlacesAfterwards, 124 TransitionsBefore, 59 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3600, independent: 3431, independent conditional: 3431, independent unconditional: 0, dependent: 169, dependent conditional: 169, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3600, independent: 3431, independent conditional: 0, independent unconditional: 3431, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3600, independent: 3431, independent conditional: 0, independent unconditional: 3431, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3600, independent: 3431, independent conditional: 0, independent unconditional: 3431, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1763, independent: 1699, independent conditional: 0, independent unconditional: 1699, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1763, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 676, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 620, dependent conditional: 0, dependent unconditional: 620, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3600, independent: 1732, independent conditional: 0, independent unconditional: 1732, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1763, unknown conditional: 0, unknown unconditional: 1763] , Statistics on independence cache: Total cache size (in pairs): 3073, Positive cache size: 3009, Positive conditional cache size: 0, Positive unconditional cache size: 3009, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, 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, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 234, independent conditional: 234, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 234, independent conditional: 27, independent unconditional: 207, dependent: 32, dependent conditional: 9, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 234, independent conditional: 27, independent unconditional: 207, dependent: 32, dependent conditional: 9, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 234, independent conditional: 27, independent unconditional: 207, dependent: 32, dependent conditional: 9, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 214, independent: 192, independent conditional: 23, independent unconditional: 169, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 214, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 126, dependent conditional: 76, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, independent: 42, independent conditional: 4, independent unconditional: 38, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 214, unknown conditional: 29, unknown unconditional: 185] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 192, Positive conditional cache size: 23, Positive unconditional cache size: 169, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 220, independent conditional: 220, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 250, independent: 220, independent conditional: 21, independent unconditional: 199, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 250, independent: 220, independent conditional: 0, independent unconditional: 220, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 250, independent: 220, independent conditional: 0, independent unconditional: 220, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 215, Positive conditional cache size: 23, Positive unconditional cache size: 192, Negative cache size: 28, Negative conditional cache size: 6, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 43 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 402, independent: 347, independent conditional: 347, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 402, independent: 347, independent conditional: 51, independent unconditional: 296, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 402, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 17, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 232, Positive conditional cache size: 23, Positive unconditional cache size: 209, Negative cache size: 29, Negative conditional cache size: 6, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 45 PlacesBefore, 44 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 231, independent: 205, independent conditional: 205, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 231, independent: 205, independent conditional: 67, independent unconditional: 138, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 231, independent: 205, independent conditional: 57, independent unconditional: 148, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 231, independent: 205, independent conditional: 57, independent unconditional: 148, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 5, independent unconditional: 13, 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: 20, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 231, independent: 187, independent conditional: 52, independent unconditional: 135, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 20, unknown conditional: 5, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 284, Positive conditional cache size: 28, Positive unconditional cache size: 256, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 102, independent conditional: 102, 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: 113, independent: 102, independent conditional: 32, independent unconditional: 70, 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: 113, independent: 102, independent conditional: 28, independent unconditional: 74, 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: 113, independent: 102, independent conditional: 28, independent unconditional: 74, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 113, independent: 101, independent conditional: 28, independent unconditional: 73, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 285, Positive conditional cache size: 28, Positive unconditional cache size: 257, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, 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: 3.1s, 50 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 228, independent: 205, independent conditional: 205, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 228, independent: 205, independent conditional: 66, independent unconditional: 139, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 228, independent: 205, independent conditional: 56, independent unconditional: 149, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 228, independent: 205, independent conditional: 56, independent unconditional: 149, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, independent: 199, independent conditional: 50, independent unconditional: 149, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 316, Positive conditional cache size: 34, Positive unconditional cache size: 282, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 49 PlacesBefore, 49 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 226, independent: 197, independent conditional: 197, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 226, independent: 197, independent conditional: 105, independent unconditional: 92, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 226, independent: 197, independent conditional: 97, independent unconditional: 100, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 226, independent: 197, independent conditional: 97, independent unconditional: 100, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 226, independent: 189, independent conditional: 94, independent unconditional: 95, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 330, Positive conditional cache size: 37, Positive unconditional cache size: 293, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 50 PlacesBefore, 47 PlacesAfterwards, 50 TransitionsBefore, 47 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 239, independent: 213, independent conditional: 213, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 239, independent: 213, independent conditional: 175, independent unconditional: 38, dependent: 26, dependent conditional: 24, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 239, independent: 213, independent conditional: 144, independent unconditional: 69, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 239, independent: 213, independent conditional: 144, independent unconditional: 69, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 239, independent: 210, independent conditional: 141, independent unconditional: 69, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 377, Positive conditional cache size: 42, Positive unconditional cache size: 335, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 46 PlacesBefore, 43 PlacesAfterwards, 43 TransitionsBefore, 40 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 68, independent conditional: 68, 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: 68, independent: 68, independent conditional: 59, independent unconditional: 9, 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: 68, independent: 68, independent conditional: 53, independent unconditional: 15, 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: 68, independent: 68, independent conditional: 53, independent unconditional: 15, 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: 22, independent: 22, independent conditional: 16, independent unconditional: 6, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 68, independent: 46, independent conditional: 37, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 16, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 413, Positive conditional cache size: 58, Positive unconditional cache size: 355, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2052, ((void *)0), P0, ((void *)0))=0, t2052={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2053, ((void *)0), P1, ((void *)0))=1, t2052={7:0}, t2053={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((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_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$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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2054, ((void *)0), P2, ((void *)0))=2, t2052={7:0}, t2053={8:0}, t2054={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 [L825] 3 z = 1 [L762] 3 __unbuffered_p0_EAX = z [L765] 3 __unbuffered_p0_EBX = x 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_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$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, 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=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 x = 1 [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 [L828] EXPR 2 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 2 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 2 \read(y) [L828] EXPR 2 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 2 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 2 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 2 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 2 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$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_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$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, 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=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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_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$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, 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=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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_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$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, 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=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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_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$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, 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=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 684 IncrementalHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 1 mSDtfsCounter, 684 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:01:43,851 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...