/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/safe021_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:04:05,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:04:05,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:04:05,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:04:05,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:04:05,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:04:05,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:04:05,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:04:05,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:04:05,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:04:05,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:04:05,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:04:05,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:04:05,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:04:05,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:04:05,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:04:05,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:04:05,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:04:05,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:04:05,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:04:05,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:04:05,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:04:05,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:04:05,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:04:05,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:04:05,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:04:05,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:04:05,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:04:05,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:04:05,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:04:05,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:04:05,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:04:05,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:04:05,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:04:05,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:04:05,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:04:05,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:04:05,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:04:05,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:04:05,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:04:05,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:04:05,545 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:04:05,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:04:05,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:04:05,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:04:05,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:04:05,580 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:04:05,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:04:05,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:04:05,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:04:05,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:04:05,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:04:05,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:04:05,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:04:05,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:04:05,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:04:05,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:04:05,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:04:05,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:04:05,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:04:05,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:04:05,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:04:05,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:04:05,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:04:05,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:04:05,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:04:05,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:04:05,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:04:05,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:04:05,585 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:04:05,585 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:04:05,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:04:05,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:04:05,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:04:05,959 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:04:05,960 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:04:05,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i [2022-12-13 12:04:07,203 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:04:07,515 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:04:07,516 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i [2022-12-13 12:04:07,531 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1495390/0350738f34b04faba82570fa10c2fab0/FLAG8d0dd8b3f [2022-12-13 12:04:07,543 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1495390/0350738f34b04faba82570fa10c2fab0 [2022-12-13 12:04:07,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:04:07,546 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:04:07,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:04:07,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:04:07,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:04:07,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:04:07" (1/1) ... [2022-12-13 12:04:07,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9e8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:07, skipping insertion in model container [2022-12-13 12:04:07,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:04:07" (1/1) ... [2022-12-13 12:04:07,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:04:07,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:04:07,752 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/safe021_power.opt_pso.opt.i[959,972] [2022-12-13 12:04:07,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:07,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:07,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:04:07,994 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:04:08,007 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/safe021_power.opt_pso.opt.i[959,972] [2022-12-13 12:04:08,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:08,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:08,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:04:08,116 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:04:08,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08 WrapperNode [2022-12-13 12:04:08,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:04:08,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:04:08,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:04:08,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:04:08,125 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:04:08" (1/1) ... [2022-12-13 12:04:08,158 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:04:08" (1/1) ... [2022-12-13 12:04:08,195 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 12:04:08,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:04:08,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:04:08,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:04:08,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:04:08,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,233 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:04:08,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:04:08,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:04:08,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:04:08,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (1/1) ... [2022-12-13 12:04:08,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:04:08,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:04:08,290 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:04:08,316 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:04:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:04:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:04:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:04:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:04:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:04:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:04:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:04:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:04:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:04:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:04:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:04:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:04:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:04:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:04:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:04:08,339 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:04:08,541 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:04:08,542 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:04:08,806 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:04:08,961 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:04:08,962 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:04:08,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:04:08 BoogieIcfgContainer [2022-12-13 12:04:08,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:04:08,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:04:08,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:04:08,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:04:08,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:04:07" (1/3) ... [2022-12-13 12:04:08,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a23c565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:04:08, skipping insertion in model container [2022-12-13 12:04:08,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:08" (2/3) ... [2022-12-13 12:04:08,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a23c565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:04:08, skipping insertion in model container [2022-12-13 12:04:08,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:04:08" (3/3) ... [2022-12-13 12:04:08,973 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2022-12-13 12:04:08,990 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:04:08,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:04:08,991 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:04:09,050 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:04:09,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 12:04:09,140 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 12:04:09,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:09,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 12:04:09,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 12:04:09,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 12:04:09,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:09,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 12:04:09,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 12:04:09,216 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 12:04:09,216 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:09,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 12:04:09,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 12:04:09,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-13 12:04:18,388 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 12:04:18,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:04:18,418 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;@50b3c384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:04:18,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 12:04:18,424 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 12:04:18,425 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:18,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:18,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:04:18,426 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:04:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash 467978769, now seen corresponding path program 1 times [2022-12-13 12:04:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:18,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810023324] [2022-12-13 12:04:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:18,889 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:04:18,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:18,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810023324] [2022-12-13 12:04:18,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810023324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:18,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:18,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:04:18,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459675902] [2022-12-13 12:04:18,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:18,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:04:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:04:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:04:18,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2022-12-13 12:04:18,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:18,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:18,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2022-12-13 12:04:18,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:20,709 INFO L130 PetriNetUnfolder]: 7924/12462 cut-off events. [2022-12-13 12:04:20,710 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 12:04:20,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23864 conditions, 12462 events. 7924/12462 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 87856 event pairs, 2218 based on Foata normal form. 0/7559 useless extension candidates. Maximal degree in co-relation 23853. Up to 9597 conditions per place. [2022-12-13 12:04:20,760 INFO L137 encePairwiseOnDemand]: 56/60 looper letters, 32 selfloop transitions, 2 changer transitions 52/97 dead transitions. [2022-12-13 12:04:20,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 378 flow [2022-12-13 12:04:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:04:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:04:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-12-13 12:04:20,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 12:04:20,773 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 129 flow. Second operand 3 states and 122 transitions. [2022-12-13 12:04:20,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 378 flow [2022-12-13 12:04:20,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 374 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:04:20,779 INFO L231 Difference]: Finished difference. Result has 67 places, 32 transitions, 74 flow [2022-12-13 12:04:20,781 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=67, PETRI_TRANSITIONS=32} [2022-12-13 12:04:20,784 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2022-12-13 12:04:20,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:20,786 INFO L89 Accepts]: Start accepts. Operand has 67 places, 32 transitions, 74 flow [2022-12-13 12:04:20,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:20,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:20,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 32 transitions, 74 flow [2022-12-13 12:04:20,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 12:04:20,796 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 12:04:20,796 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:20,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 82 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 12:04:20,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 12:04:20,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 12:04:20,870 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:20,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 12:04:20,872 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 12:04:20,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:20,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:20,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:20,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:04:20,873 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:04:20,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:20,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1423142085, now seen corresponding path program 1 times [2022-12-13 12:04:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:20,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257791838] [2022-12-13 12:04:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:21,449 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:04:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:21,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257791838] [2022-12-13 12:04:21,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257791838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:21,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:21,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:04:21,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292651347] [2022-12-13 12:04:21,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:21,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:21,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:21,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:21,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 12:04:21,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:21,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:21,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 12:04:21,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:21,808 INFO L130 PetriNetUnfolder]: 1626/2528 cut-off events. [2022-12-13 12:04:21,809 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-12-13 12:04:21,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 2528 events. 1626/2528 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12619 event pairs, 346 based on Foata normal form. 30/2156 useless extension candidates. Maximal degree in co-relation 5135. Up to 2001 conditions per place. [2022-12-13 12:04:21,826 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 32 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-12-13 12:04:21,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 166 flow [2022-12-13 12:04:21,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:04:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:04:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 12:04:21,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-13 12:04:21,829 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 62 transitions. [2022-12-13 12:04:21,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 166 flow [2022-12-13 12:04:21,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:04:21,833 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 78 flow [2022-12-13 12:04:21,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 12:04:21,834 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -28 predicate places. [2022-12-13 12:04:21,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:21,834 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 78 flow [2022-12-13 12:04:21,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:21,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:21,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 78 flow [2022-12-13 12:04:21,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 78 flow [2022-12-13 12:04:21,844 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 12:04:21,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:21,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 83 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:04:21,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 78 flow [2022-12-13 12:04:21,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 12:04:21,863 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:21,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 12:04:21,866 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 78 flow [2022-12-13 12:04:21,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:21,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:21,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:21,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:04:21,867 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:04:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1167732390, now seen corresponding path program 1 times [2022-12-13 12:04:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:21,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411611282] [2022-12-13 12:04:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:22,285 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:04:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411611282] [2022-12-13 12:04:22,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411611282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:22,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:22,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:04:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487393393] [2022-12-13 12:04:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:22,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:22,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:22,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:22,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 12:04:22,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:22,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:22,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 12:04:22,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:22,710 INFO L130 PetriNetUnfolder]: 2096/3268 cut-off events. [2022-12-13 12:04:22,711 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-13 12:04:22,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6812 conditions, 3268 events. 2096/3268 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17331 event pairs, 211 based on Foata normal form. 18/2831 useless extension candidates. Maximal degree in co-relation 6801. Up to 2058 conditions per place. [2022-12-13 12:04:22,735 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 51 selfloop transitions, 12 changer transitions 0/71 dead transitions. [2022-12-13 12:04:22,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 296 flow [2022-12-13 12:04:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:04:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:04:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 12:04:22,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 12:04:22,740 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 78 flow. Second operand 5 states and 105 transitions. [2022-12-13 12:04:22,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 296 flow [2022-12-13 12:04:22,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:04:22,743 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 159 flow [2022-12-13 12:04:22,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-13 12:04:22,745 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2022-12-13 12:04:22,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:22,745 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 159 flow [2022-12-13 12:04:22,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:22,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:22,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 159 flow [2022-12-13 12:04:22,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 159 flow [2022-12-13 12:04:22,810 INFO L130 PetriNetUnfolder]: 98/294 cut-off events. [2022-12-13 12:04:22,810 INFO L131 PetriNetUnfolder]: For 91/94 co-relation queries the response was YES. [2022-12-13 12:04:22,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 294 events. 98/294 cut-off events. For 91/94 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1745 event pairs, 30 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 622. Up to 122 conditions per place. [2022-12-13 12:04:22,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 159 flow [2022-12-13 12:04:22,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-13 12:04:22,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [437] L2-1-->L836: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd0~0_158 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_293 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_158 256) 0)))) (let ((.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_294 256))))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_261 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_294) v_~x$w_buff0_used~0_293) (= (ite .cse0 v_~x$w_buff0~0_185 (ite .cse1 v_~x$w_buff1~0_164 v_~x~0_229)) v_~x~0_228) (= v_~x$r_buff0_thd0~0_157 (ite .cse2 0 v_~x$r_buff0_thd0~0_158)) (= v_~x$r_buff1_thd0~0_157 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_260 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_157 256) 0)))) 0 v_~x$r_buff1_thd0~0_158)) (= v_~x$w_buff1_used~0_260 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_261))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_261, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x~0=v_~x~0_229, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_157, ~x~0=v_~x~0_228, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 12:04:23,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [326] L747-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_108 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_109)) (= (ite .cse2 0 v_~x$w_buff0_used~0_124) v_~x$w_buff0_used~0_123) (= v_~x~0_85 (ite .cse2 v_~x$w_buff0~0_53 (ite .cse1 v_~x$w_buff1~0_48 v_~x~0_86))) (= v_~x$r_buff1_thd1~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_108 256) 0)))) 0 v_~x$r_buff1_thd1~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_20) v_~x$r_buff0_thd1~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x~0=v_~x~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 12:04:23,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [340] L793-->L796: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-13 12:04:23,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:04:23,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 452 [2022-12-13 12:04:23,198 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 167 flow [2022-12-13 12:04:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:23,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:23,198 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:23,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:04:23,198 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:04:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1169933700, now seen corresponding path program 2 times [2022-12-13 12:04:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:23,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011174735] [2022-12-13 12:04:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:23,523 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:04:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011174735] [2022-12-13 12:04:23,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011174735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:23,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:23,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:04:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288400048] [2022-12-13 12:04:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:23,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:04:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:04:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:04:23,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2022-12-13 12:04:23,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:04:23,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:23,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2022-12-13 12:04:23,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:24,035 INFO L130 PetriNetUnfolder]: 2658/4179 cut-off events. [2022-12-13 12:04:24,036 INFO L131 PetriNetUnfolder]: For 3430/3430 co-relation queries the response was YES. [2022-12-13 12:04:24,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11154 conditions, 4179 events. 2658/4179 cut-off events. For 3430/3430 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22769 event pairs, 574 based on Foata normal form. 180/3707 useless extension candidates. Maximal degree in co-relation 11140. Up to 1577 conditions per place. [2022-12-13 12:04:24,059 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 43 selfloop transitions, 3 changer transitions 15/69 dead transitions. [2022-12-13 12:04:24,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 376 flow [2022-12-13 12:04:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 12:04:24,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 12:04:24,061 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 167 flow. Second operand 4 states and 90 transitions. [2022-12-13 12:04:24,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 376 flow [2022-12-13 12:04:24,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 362 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 12:04:24,071 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 132 flow [2022-12-13 12:04:24,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-13 12:04:24,073 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2022-12-13 12:04:24,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:24,073 INFO L89 Accepts]: Start accepts. Operand has 50 places, 35 transitions, 132 flow [2022-12-13 12:04:24,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:24,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:24,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 132 flow [2022-12-13 12:04:24,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 35 transitions, 132 flow [2022-12-13 12:04:24,089 INFO L130 PetriNetUnfolder]: 33/110 cut-off events. [2022-12-13 12:04:24,090 INFO L131 PetriNetUnfolder]: For 56/62 co-relation queries the response was YES. [2022-12-13 12:04:24,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 110 events. 33/110 cut-off events. For 56/62 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 464 event pairs, 29 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 248. Up to 55 conditions per place. [2022-12-13 12:04:24,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 132 flow [2022-12-13 12:04:24,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 548 [2022-12-13 12:04:24,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:04:24,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-13 12:04:24,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 134 flow [2022-12-13 12:04:24,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:04:24,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:24,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:24,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:04:24,325 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:04:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2085097757, now seen corresponding path program 1 times [2022-12-13 12:04:24,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:24,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051530418] [2022-12-13 12:04:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:25,182 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:04:25,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:25,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051530418] [2022-12-13 12:04:25,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051530418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:25,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:25,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:04:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851457840] [2022-12-13 12:04:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:25,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:04:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:25,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:04:25,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:04:25,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 12:04:25,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 134 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:04:25,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:25,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 12:04:25,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:25,526 INFO L130 PetriNetUnfolder]: 1338/2113 cut-off events. [2022-12-13 12:04:25,527 INFO L131 PetriNetUnfolder]: For 2535/2535 co-relation queries the response was YES. [2022-12-13 12:04:25,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6081 conditions, 2113 events. 1338/2113 cut-off events. For 2535/2535 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9900 event pairs, 698 based on Foata normal form. 6/1766 useless extension candidates. Maximal degree in co-relation 6064. Up to 1881 conditions per place. [2022-12-13 12:04:25,542 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 43 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2022-12-13 12:04:25,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 360 flow [2022-12-13 12:04:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:04:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:04:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 12:04:25,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-13 12:04:25,545 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 134 flow. Second operand 5 states and 94 transitions. [2022-12-13 12:04:25,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 360 flow [2022-12-13 12:04:25,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 320 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 12:04:25,550 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 192 flow [2022-12-13 12:04:25,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-13 12:04:25,550 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2022-12-13 12:04:25,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:25,551 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 192 flow [2022-12-13 12:04:25,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:25,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:25,552 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 192 flow [2022-12-13 12:04:25,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 192 flow [2022-12-13 12:04:25,572 INFO L130 PetriNetUnfolder]: 71/218 cut-off events. [2022-12-13 12:04:25,572 INFO L131 PetriNetUnfolder]: For 156/168 co-relation queries the response was YES. [2022-12-13 12:04:25,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 218 events. 71/218 cut-off events. For 156/168 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1142 event pairs, 49 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 542. Up to 104 conditions per place. [2022-12-13 12:04:25,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 192 flow [2022-12-13 12:04:25,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-13 12:04:25,632 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [488] $Ultimate##0-->L776: Formula: (and (= v_~x$r_buff0_thd3~0_235 v_~x$r_buff1_thd3~0_227) (= v_~x$w_buff0~0_433 v_~x$w_buff1~0_394) (= v_~x$r_buff0_thd0~0_364 v_~x$r_buff1_thd0~0_363) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_33| |v_P1Thread1of1ForFork0_~arg#1.offset_33|) (= v_~x$w_buff0_used~0_648 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_33| |v_P1Thread1of1ForFork0_#in~arg#1.base_33|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_596 256) 0)) (not (= (mod v_~x$w_buff0_used~0_648 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= v_~x$r_buff0_thd2~0_142 1) (= v_~x$r_buff0_thd1~0_105 v_~x$r_buff1_thd1~0_106) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| 0)) (= v_~x$r_buff0_thd2~0_143 v_~x$r_buff1_thd2~0_107) (= v_~y~0_36 1) (= v_~x$w_buff0_used~0_649 v_~x$w_buff1_used~0_596) (= 2 v_~x$w_buff0~0_432)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_433, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_364, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_105, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_235, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_143, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_649} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_364, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_105, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_33|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_33|, ~x$w_buff1~0=v_~x$w_buff1~0_394, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_227, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_107, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_596, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_106, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_235, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_142, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_363, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_648, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~y~0=v_~y~0_36} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-13 12:04:25,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [489] $Ultimate##0-->L776: Formula: (and (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= v_~x$r_buff0_thd0~0_366 v_~x$r_buff1_thd0~0_365) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_38 1) (= v_~x$r_buff0_thd2~0_147 v_~x$r_buff1_thd2~0_109) (= 2 v_~x$w_buff0~0_436) (= v_~x$w_buff0_used~0_653 v_~x$w_buff1_used~0_598) (= v_~x$r_buff0_thd3~0_237 v_~x$r_buff1_thd3~0_229) (= v_~x$r_buff0_thd1~0_107 v_~x$r_buff1_thd1~0_108) (= v_~x$w_buff0~0_437 v_~x$w_buff1~0_396) (= v_~x$w_buff0_used~0_652 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_652 256))) (not (= (mod v_~x$w_buff1_used~0_598 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$r_buff0_thd2~0_146 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_437, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_366, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_237, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_147, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_653} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_436, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_366, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~x$w_buff1~0=v_~x$w_buff1~0_396, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_229, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_109, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_598, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_108, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_237, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_146, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_365, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_652, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-13 12:04:26,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:04:26,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-13 12:04:26,014 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 195 flow [2022-12-13 12:04:26,015 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:04:26,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:26,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:26,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:04:26,015 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:04:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1156323851, now seen corresponding path program 1 times [2022-12-13 12:04:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495736754] [2022-12-13 12:04:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:26,158 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:04:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:26,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495736754] [2022-12-13 12:04:26,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495736754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:26,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:26,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:04:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946391056] [2022-12-13 12:04:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:26,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:04:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:26,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:04:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:04:26,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2022-12-13 12:04:26,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:04:26,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:26,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2022-12-13 12:04:26,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:26,453 INFO L130 PetriNetUnfolder]: 1801/2760 cut-off events. [2022-12-13 12:04:26,453 INFO L131 PetriNetUnfolder]: For 3230/3311 co-relation queries the response was YES. [2022-12-13 12:04:26,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8298 conditions, 2760 events. 1801/2760 cut-off events. For 3230/3311 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13688 event pairs, 545 based on Foata normal form. 27/1949 useless extension candidates. Maximal degree in co-relation 8282. Up to 2554 conditions per place. [2022-12-13 12:04:26,474 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 39 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2022-12-13 12:04:26,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 320 flow [2022-12-13 12:04:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:04:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:04:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 12:04:26,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-13 12:04:26,475 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 195 flow. Second operand 3 states and 68 transitions. [2022-12-13 12:04:26,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 320 flow [2022-12-13 12:04:26,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 316 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 12:04:26,479 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 226 flow [2022-12-13 12:04:26,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2022-12-13 12:04:26,480 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -18 predicate places. [2022-12-13 12:04:26,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:26,480 INFO L89 Accepts]: Start accepts. Operand has 52 places, 46 transitions, 226 flow [2022-12-13 12:04:26,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:26,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:26,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 226 flow [2022-12-13 12:04:26,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 226 flow [2022-12-13 12:04:26,562 INFO L130 PetriNetUnfolder]: 561/1103 cut-off events. [2022-12-13 12:04:26,563 INFO L131 PetriNetUnfolder]: For 365/376 co-relation queries the response was YES. [2022-12-13 12:04:26,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 1103 events. 561/1103 cut-off events. For 365/376 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 7264 event pairs, 317 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 2752. Up to 736 conditions per place. [2022-12-13 12:04:26,574 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 226 flow [2022-12-13 12:04:26,574 INFO L226 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-13 12:04:26,577 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:26,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 12:04:26,578 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 226 flow [2022-12-13 12:04:26,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:04:26,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:26,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:26,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:04:26,579 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:04:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1609904840, now seen corresponding path program 1 times [2022-12-13 12:04:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:26,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705229032] [2022-12-13 12:04:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:26,722 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:04:26,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:26,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705229032] [2022-12-13 12:04:26,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705229032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:26,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:26,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:04:26,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887813646] [2022-12-13 12:04:26,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:26,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:26,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:26,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:26,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:26,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 12:04:26,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 226 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:04:26,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:26,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 12:04:26,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:26,968 INFO L130 PetriNetUnfolder]: 937/1632 cut-off events. [2022-12-13 12:04:26,968 INFO L131 PetriNetUnfolder]: For 1711/1744 co-relation queries the response was YES. [2022-12-13 12:04:26,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5832 conditions, 1632 events. 937/1632 cut-off events. For 1711/1744 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8594 event pairs, 143 based on Foata normal form. 87/1244 useless extension candidates. Maximal degree in co-relation 5813. Up to 1135 conditions per place. [2022-12-13 12:04:26,978 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 46 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2022-12-13 12:04:26,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 464 flow [2022-12-13 12:04:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 12:04:26,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6691176470588235 [2022-12-13 12:04:26,980 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 226 flow. Second operand 4 states and 91 transitions. [2022-12-13 12:04:26,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 464 flow [2022-12-13 12:04:26,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 446 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 12:04:26,983 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 322 flow [2022-12-13 12:04:26,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2022-12-13 12:04:26,984 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -16 predicate places. [2022-12-13 12:04:26,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:26,984 INFO L89 Accepts]: Start accepts. Operand has 54 places, 55 transitions, 322 flow [2022-12-13 12:04:26,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:26,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:26,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 55 transitions, 322 flow [2022-12-13 12:04:26,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 322 flow [2022-12-13 12:04:27,047 INFO L130 PetriNetUnfolder]: 294/710 cut-off events. [2022-12-13 12:04:27,047 INFO L131 PetriNetUnfolder]: For 285/371 co-relation queries the response was YES. [2022-12-13 12:04:27,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 710 events. 294/710 cut-off events. For 285/371 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4748 event pairs, 77 based on Foata normal form. 7/451 useless extension candidates. Maximal degree in co-relation 2415. Up to 445 conditions per place. [2022-12-13 12:04:27,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 322 flow [2022-12-13 12:04:27,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 636 [2022-12-13 12:04:27,057 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:27,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 12:04:27,058 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 322 flow [2022-12-13 12:04:27,058 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:04:27,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:27,059 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:04:27,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:04:27,059 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:04:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash -673010932, now seen corresponding path program 1 times [2022-12-13 12:04:27,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:27,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492144560] [2022-12-13 12:04:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:27,252 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:04:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:27,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492144560] [2022-12-13 12:04:27,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492144560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:27,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:27,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:04:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337545482] [2022-12-13 12:04:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:27,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:04:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:04:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:04:27,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 12:04:27,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:27,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:27,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 12:04:27,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:27,435 INFO L130 PetriNetUnfolder]: 505/942 cut-off events. [2022-12-13 12:04:27,435 INFO L131 PetriNetUnfolder]: For 1029/1038 co-relation queries the response was YES. [2022-12-13 12:04:27,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3834 conditions, 942 events. 505/942 cut-off events. For 1029/1038 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4607 event pairs, 44 based on Foata normal form. 90/728 useless extension candidates. Maximal degree in co-relation 3814. Up to 454 conditions per place. [2022-12-13 12:04:27,443 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 37 selfloop transitions, 28 changer transitions 0/72 dead transitions. [2022-12-13 12:04:27,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 522 flow [2022-12-13 12:04:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:04:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:04:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 12:04:27,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5764705882352941 [2022-12-13 12:04:27,445 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 322 flow. Second operand 5 states and 98 transitions. [2022-12-13 12:04:27,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 522 flow [2022-12-13 12:04:27,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 468 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 12:04:27,451 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 346 flow [2022-12-13 12:04:27,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2022-12-13 12:04:27,454 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -14 predicate places. [2022-12-13 12:04:27,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:27,454 INFO L89 Accepts]: Start accepts. Operand has 56 places, 55 transitions, 346 flow [2022-12-13 12:04:27,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:27,456 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:27,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 55 transitions, 346 flow [2022-12-13 12:04:27,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 55 transitions, 346 flow [2022-12-13 12:04:27,484 INFO L130 PetriNetUnfolder]: 132/377 cut-off events. [2022-12-13 12:04:27,484 INFO L131 PetriNetUnfolder]: For 250/315 co-relation queries the response was YES. [2022-12-13 12:04:27,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 377 events. 132/377 cut-off events. For 250/315 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2129 event pairs, 5 based on Foata normal form. 1/193 useless extension candidates. Maximal degree in co-relation 1236. Up to 235 conditions per place. [2022-12-13 12:04:27,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 55 transitions, 346 flow [2022-12-13 12:04:27,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 564 [2022-12-13 12:04:28,733 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:04:28,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1281 [2022-12-13 12:04:28,735 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 340 flow [2022-12-13 12:04:28,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:28,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:28,736 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:04:28,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:04:28,736 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:04:28,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:28,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2121025336, now seen corresponding path program 1 times [2022-12-13 12:04:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:28,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016399651] [2022-12-13 12:04:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:28,925 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:04:28,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:28,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016399651] [2022-12-13 12:04:28,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016399651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:28,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:28,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:04:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599572063] [2022-12-13 12:04:28,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:28,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:28,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:28,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:28,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 12:04:28,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:04:28,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:28,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 12:04:28,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:29,091 INFO L130 PetriNetUnfolder]: 521/980 cut-off events. [2022-12-13 12:04:29,091 INFO L131 PetriNetUnfolder]: For 1874/1990 co-relation queries the response was YES. [2022-12-13 12:04:29,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4102 conditions, 980 events. 521/980 cut-off events. For 1874/1990 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5300 event pairs, 29 based on Foata normal form. 80/841 useless extension candidates. Maximal degree in co-relation 4082. Up to 484 conditions per place. [2022-12-13 12:04:29,099 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 45 selfloop transitions, 1 changer transitions 35/94 dead transitions. [2022-12-13 12:04:29,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 790 flow [2022-12-13 12:04:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 12:04:29,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-13 12:04:29,101 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 340 flow. Second operand 4 states and 80 transitions. [2022-12-13 12:04:29,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 790 flow [2022-12-13 12:04:29,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 656 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 12:04:29,135 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 249 flow [2022-12-13 12:04:29,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 12:04:29,136 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -15 predicate places. [2022-12-13 12:04:29,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:29,137 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 249 flow [2022-12-13 12:04:29,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:29,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:29,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 249 flow [2022-12-13 12:04:29,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 249 flow [2022-12-13 12:04:29,172 INFO L130 PetriNetUnfolder]: 203/375 cut-off events. [2022-12-13 12:04:29,172 INFO L131 PetriNetUnfolder]: For 250/255 co-relation queries the response was YES. [2022-12-13 12:04:29,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 375 events. 203/375 cut-off events. For 250/255 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 1823 event pairs, 1 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 1008. Up to 190 conditions per place. [2022-12-13 12:04:29,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 249 flow [2022-12-13 12:04:29,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 12:04:29,201 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:04:29,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 12:04:29,202 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 247 flow [2022-12-13 12:04:29,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:04:29,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:29,202 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:04:29,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:04:29,203 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:04:29,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1563814015, now seen corresponding path program 1 times [2022-12-13 12:04:29,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:29,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481943178] [2022-12-13 12:04:29,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:29,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:29,832 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:04:29,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481943178] [2022-12-13 12:04:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481943178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:29,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:29,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:04:29,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382136241] [2022-12-13 12:04:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:29,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:04:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:04:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:04:29,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 12:04:29,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:29,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:29,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 12:04:29,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:30,018 INFO L130 PetriNetUnfolder]: 488/918 cut-off events. [2022-12-13 12:04:30,018 INFO L131 PetriNetUnfolder]: For 1525/1566 co-relation queries the response was YES. [2022-12-13 12:04:30,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 918 events. 488/918 cut-off events. For 1525/1566 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5123 event pairs, 12 based on Foata normal form. 61/752 useless extension candidates. Maximal degree in co-relation 3323. Up to 409 conditions per place. [2022-12-13 12:04:30,024 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 49 selfloop transitions, 14 changer transitions 13/87 dead transitions. [2022-12-13 12:04:30,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 615 flow [2022-12-13 12:04:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:04:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:04:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-13 12:04:30,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2022-12-13 12:04:30,026 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 247 flow. Second operand 6 states and 79 transitions. [2022-12-13 12:04:30,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 615 flow [2022-12-13 12:04:30,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 603 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 12:04:30,048 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 332 flow [2022-12-13 12:04:30,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2022-12-13 12:04:30,049 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -16 predicate places. [2022-12-13 12:04:30,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:30,049 INFO L89 Accepts]: Start accepts. Operand has 54 places, 53 transitions, 332 flow [2022-12-13 12:04:30,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:30,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:30,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 53 transitions, 332 flow [2022-12-13 12:04:30,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 332 flow [2022-12-13 12:04:30,087 INFO L130 PetriNetUnfolder]: 316/602 cut-off events. [2022-12-13 12:04:30,088 INFO L131 PetriNetUnfolder]: For 350/353 co-relation queries the response was YES. [2022-12-13 12:04:30,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1682 conditions, 602 events. 316/602 cut-off events. For 350/353 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 3388 event pairs, 1 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 1663. Up to 271 conditions per place. [2022-12-13 12:04:30,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 332 flow [2022-12-13 12:04:30,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-13 12:04:30,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] $Ultimate##0-->L776: Formula: (and (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= v_~x$r_buff0_thd0~0_366 v_~x$r_buff1_thd0~0_365) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_38 1) (= v_~x$r_buff0_thd2~0_147 v_~x$r_buff1_thd2~0_109) (= 2 v_~x$w_buff0~0_436) (= v_~x$w_buff0_used~0_653 v_~x$w_buff1_used~0_598) (= v_~x$r_buff0_thd3~0_237 v_~x$r_buff1_thd3~0_229) (= v_~x$r_buff0_thd1~0_107 v_~x$r_buff1_thd1~0_108) (= v_~x$w_buff0~0_437 v_~x$w_buff1~0_396) (= v_~x$w_buff0_used~0_652 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_652 256))) (not (= (mod v_~x$w_buff1_used~0_598 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$r_buff0_thd2~0_146 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_437, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_366, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_237, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_147, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_653} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_436, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_366, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~x$w_buff1~0=v_~x$w_buff1~0_396, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_229, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_109, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_598, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_108, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_237, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_146, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_365, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_652, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [498] $Ultimate##0-->L803: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_695 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_244 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_236 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_637 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_696 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_465 (ite .cse1 v_~x$w_buff1~0_418 v_~x~0_604)) v_~x~0_603) (= (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_243 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_636 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_236) v_~x$r_buff1_thd3~0_235) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_244) v_~x$r_buff0_thd3~0_243) (= v_~__unbuffered_p2_EBX~0_138 v_~z~0_44) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_637) v_~x$w_buff1_used~0_636) (= v_~x$w_buff0_used~0_695 (ite .cse0 0 v_~x$w_buff0_used~0_696)) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_139)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_465, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_418, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_236, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_637, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_244, ~z~0=v_~z~0_44, ~y~0=v_~y~0_50, ~x~0=v_~x~0_604, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_696} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_465, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_138, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~x$w_buff1~0=v_~x$w_buff1~0_418, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_235, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_636, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_243, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_695, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_139, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_44, ~y~0=v_~y~0_50, ~x~0=v_~x~0_603} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 12:04:30,422 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:04:30,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 374 [2022-12-13 12:04:30,423 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 341 flow [2022-12-13 12:04:30,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:30,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:30,423 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:04:30,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:04:30,424 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash 408848329, now seen corresponding path program 2 times [2022-12-13 12:04:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:30,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018126327] [2022-12-13 12:04:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:30,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:04:30,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:04:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:04:30,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:04:30,528 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:04:30,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 12:04:30,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 12:04:30,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 12:04:30,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 12:04:30,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 12:04:30,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 12:04:30,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:04:30,534 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:30,543 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:04:30,543 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:04:30,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:04:30 BasicIcfg [2022-12-13 12:04:30,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:04:30,631 INFO L158 Benchmark]: Toolchain (without parser) took 23083.80ms. Allocated memory was 179.3MB in the beginning and 892.3MB in the end (delta: 713.0MB). Free memory was 154.6MB in the beginning and 384.6MB in the end (delta: -230.0MB). Peak memory consumption was 484.0MB. Max. memory is 8.0GB. [2022-12-13 12:04:30,631 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:04:30,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.75ms. Allocated memory is still 179.3MB. Free memory was 154.6MB in the beginning and 128.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 12:04:30,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.43ms. Allocated memory is still 179.3MB. Free memory was 128.3MB in the beginning and 125.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:04:30,632 INFO L158 Benchmark]: Boogie Preprocessor took 57.07ms. Allocated memory is still 179.3MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:04:30,632 INFO L158 Benchmark]: RCFGBuilder took 711.24ms. Allocated memory is still 179.3MB. Free memory was 123.1MB in the beginning and 88.0MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 12:04:30,633 INFO L158 Benchmark]: TraceAbstraction took 21662.32ms. Allocated memory was 179.3MB in the beginning and 892.3MB in the end (delta: 713.0MB). Free memory was 86.9MB in the beginning and 384.6MB in the end (delta: -297.7MB). Peak memory consumption was 416.9MB. Max. memory is 8.0GB. [2022-12-13 12:04:30,634 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 179.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 569.75ms. Allocated memory is still 179.3MB. Free memory was 154.6MB in the beginning and 128.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.43ms. Allocated memory is still 179.3MB. Free memory was 128.3MB in the beginning and 125.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.07ms. Allocated memory is still 179.3MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 711.24ms. Allocated memory is still 179.3MB. Free memory was 123.1MB in the beginning and 88.0MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21662.32ms. Allocated memory was 179.3MB in the beginning and 892.3MB in the end (delta: 713.0MB). Free memory was 86.9MB in the beginning and 384.6MB in the end (delta: -297.7MB). Peak memory consumption was 416.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 113 PlacesBefore, 70 PlacesAfterwards, 105 TransitionsBefore, 60 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3277, independent: 3022, independent conditional: 3022, independent unconditional: 0, dependent: 255, dependent conditional: 255, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3277, independent: 3022, independent conditional: 0, independent unconditional: 3022, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3277, independent: 3022, independent conditional: 0, independent unconditional: 3022, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3277, independent: 3022, independent conditional: 0, independent unconditional: 3022, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1676, independent: 1617, independent conditional: 0, independent unconditional: 1617, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1676, independent: 1599, independent conditional: 0, independent unconditional: 1599, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 553, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 540, dependent conditional: 0, dependent unconditional: 540, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3277, independent: 1405, independent conditional: 0, independent unconditional: 1405, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1676, unknown conditional: 0, unknown unconditional: 1676] , Statistics on independence cache: Total cache size (in pairs): 3226, Positive cache size: 3167, Positive conditional cache size: 0, Positive unconditional cache size: 3167, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 226, independent conditional: 226, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 226, independent conditional: 16, independent unconditional: 210, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 226, independent conditional: 16, independent unconditional: 210, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 226, independent conditional: 16, independent unconditional: 210, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 220, independent: 198, independent conditional: 15, independent unconditional: 183, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 220, independent: 180, independent conditional: 0, independent unconditional: 180, 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: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 28, independent conditional: 1, independent unconditional: 27, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 220, unknown conditional: 17, unknown unconditional: 203] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 198, Positive conditional cache size: 15, Positive unconditional cache size: 183, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, independent: 214, independent conditional: 214, 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: 246, independent: 214, independent conditional: 9, independent unconditional: 205, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 212, Positive conditional cache size: 15, Positive unconditional cache size: 197, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 47 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 694 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 308, independent: 282, independent conditional: 282, 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: 308, independent: 282, independent conditional: 74, independent unconditional: 208, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 308, independent: 282, independent conditional: 24, independent unconditional: 258, 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: 308, independent: 282, independent conditional: 24, independent unconditional: 258, 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: 19, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 19, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 308, independent: 265, independent conditional: 24, independent unconditional: 241, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 247, Positive conditional cache size: 15, Positive unconditional cache size: 232, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 50 PlacesBefore, 49 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 186, independent conditional: 186, 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: 212, independent: 186, independent conditional: 42, independent unconditional: 144, 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: 212, independent: 186, independent conditional: 6, independent unconditional: 180, 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: 212, independent: 186, independent conditional: 6, independent unconditional: 180, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 184, independent conditional: 6, independent unconditional: 178, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 277, Positive conditional cache size: 15, Positive unconditional cache size: 262, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 272, independent: 258, independent conditional: 258, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 272, independent: 258, independent conditional: 98, independent unconditional: 160, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 272, independent: 258, independent conditional: 52, independent unconditional: 206, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 272, independent: 258, independent conditional: 52, independent unconditional: 206, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 272, independent: 255, independent conditional: 50, independent unconditional: 205, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 332, Positive conditional cache size: 17, Positive unconditional cache size: 315, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 56, independent conditional: 18, independent unconditional: 38, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 56, independent conditional: 15, independent unconditional: 41, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 56, independent conditional: 15, independent unconditional: 41, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 60, independent: 55, independent conditional: 15, independent unconditional: 40, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 333, Positive conditional cache size: 17, Positive unconditional cache size: 316, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 48, independent conditional: 20, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 48, independent conditional: 17, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 48, independent conditional: 17, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 46, independent conditional: 15, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 335, Positive conditional cache size: 19, Positive unconditional cache size: 316, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 56 PlacesBefore, 53 PlacesAfterwards, 55 TransitionsBefore, 52 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 178, independent conditional: 118, independent unconditional: 60, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 178, independent conditional: 110, independent unconditional: 68, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 178, independent conditional: 110, independent unconditional: 68, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 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: 186, independent: 172, independent conditional: 106, independent unconditional: 66, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 377, Positive cache size: 347, Positive conditional cache size: 23, Positive unconditional cache size: 324, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 50 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 47, independent conditional: 35, independent unconditional: 12, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 47, independent conditional: 35, independent unconditional: 12, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 47, independent conditional: 35, independent unconditional: 12, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 47, independent conditional: 35, independent unconditional: 12, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 375, Positive conditional cache size: 25, Positive unconditional cache size: 350, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, 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.3s, 53 PlacesBefore, 53 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, 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: 9, independent: 9, independent conditional: 4, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 383, Positive conditional cache size: 27, Positive unconditional cache size: 356, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2284; [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-3, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-2, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=-1, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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: 823]: 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: 821]: 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: 825]: 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, 135 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: 21.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 12 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 950 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:04:30,678 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...