/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe028_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:53:27,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:53:27,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:53:27,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:53:27,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:53:27,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:53:27,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:53:27,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:53:27,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:53:27,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:53:27,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:53:27,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:53:27,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:53:27,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:53:27,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:53:27,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:53:27,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:53:27,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:53:27,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:53:27,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:53:27,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:53:27,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:53:27,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:53:27,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:53:27,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:53:27,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:53:27,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:53:27,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:53:27,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:53:27,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:53:27,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:53:27,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:53:27,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:53:27,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:53:27,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:53:27,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:53:27,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:53:27,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:53:27,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:53:27,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:53:27,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:53:27,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:53:27,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:53:27,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:53:27,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:53:27,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:53:27,129 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:53:27,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:53:27,130 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:53:27,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:53:27,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:53:27,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:53:27,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:53:27,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:53:27,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:53:27,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:27,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:53:27,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:53:27,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:53:27,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:53:27,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:53:27,132 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:53:27,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:53:27,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:53:27,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:53:27,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:53:27,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:53:27,405 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:53:27,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_power.i [2022-12-13 00:53:28,404 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:53:28,640 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:53:28,641 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_power.i [2022-12-13 00:53:28,658 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e84e9511/60a1e1f4327d4f7993be796ffac704d0/FLAG9e2866929 [2022-12-13 00:53:28,667 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e84e9511/60a1e1f4327d4f7993be796ffac704d0 [2022-12-13 00:53:28,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:53:28,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:53:28,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:53:28,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:53:28,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:53:28,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:28" (1/1) ... [2022-12-13 00:53:28,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d0b8160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:28, skipping insertion in model container [2022-12-13 00:53:28,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:28" (1/1) ... [2022-12-13 00:53:28,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:53:28,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:53:28,810 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/safe028_power.i[990,1003] [2022-12-13 00:53:28,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:28,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:28,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:53:28,997 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:53:29,008 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/safe028_power.i[990,1003] [2022-12-13 00:53:29,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:29,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:29,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:53:29,077 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:53:29,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29 WrapperNode [2022-12-13 00:53:29,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:53:29,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:53:29,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:53:29,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:53:29,083 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:53:29" (1/1) ... [2022-12-13 00:53:29,095 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:53:29" (1/1) ... [2022-12-13 00:53:29,113 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-12-13 00:53:29,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:53:29,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:53:29,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:53:29,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:53:29,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,146 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:53:29,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:53:29,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:53:29,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:53:29,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (1/1) ... [2022-12-13 00:53:29,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:53:29,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:53:29,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:53:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:53:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:53:29,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:53:29,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:53:29,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:53:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:53:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:53:29,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:53:29,216 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:53:29,352 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:53:29,353 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:53:29,727 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:53:29,973 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:53:29,973 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:53:29,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:29 BoogieIcfgContainer [2022-12-13 00:53:29,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:53:29,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:53:29,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:53:29,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:53:29,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:53:28" (1/3) ... [2022-12-13 00:53:29,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fbdb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:29, skipping insertion in model container [2022-12-13 00:53:29,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:29" (2/3) ... [2022-12-13 00:53:29,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fbdb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:29, skipping insertion in model container [2022-12-13 00:53:29,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:29" (3/3) ... [2022-12-13 00:53:29,984 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_power.i [2022-12-13 00:53:29,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:53:29,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:53:29,997 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:53:30,063 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:53:30,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:53:30,147 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 00:53:30,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:30,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 00:53:30,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:53:30,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-13 00:53:30,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:30,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-13 00:53:30,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-13 00:53:30,211 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 00:53:30,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:30,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 00:53:30,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-13 00:53:30,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-13 00:53:37,567 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-13 00:53:37,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:53:37,581 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;@3b88a29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:53:37,581 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:53:37,584 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 00:53:37,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:37,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:37,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:53:37,584 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 00:53:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 838443327, now seen corresponding path program 1 times [2022-12-13 00:53:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:37,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300412854] [2022-12-13 00:53:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:37,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:37,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300412854] [2022-12-13 00:53:37,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300412854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:37,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:37,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:53:37,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242305817] [2022-12-13 00:53:37,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:37,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:37,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:37,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:37,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:37,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-13 00:53:37,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:37,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:37,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-13 00:53:37,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:39,253 INFO L130 PetriNetUnfolder]: 7624/11814 cut-off events. [2022-12-13 00:53:39,253 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 00:53:39,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22791 conditions, 11814 events. 7624/11814 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 78282 event pairs, 2133 based on Foata normal form. 0/7272 useless extension candidates. Maximal degree in co-relation 22780. Up to 9237 conditions per place. [2022-12-13 00:53:39,281 INFO L137 encePairwiseOnDemand]: 54/59 looper letters, 32 selfloop transitions, 2 changer transitions 51/94 dead transitions. [2022-12-13 00:53:39,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 94 transitions, 368 flow [2022-12-13 00:53:39,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-12-13 00:53:39,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2022-12-13 00:53:39,290 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 127 flow. Second operand 3 states and 119 transitions. [2022-12-13 00:53:39,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 94 transitions, 368 flow [2022-12-13 00:53:39,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 364 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:39,294 INFO L231 Difference]: Finished difference. Result has 65 places, 30 transitions, 70 flow [2022-12-13 00:53:39,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=65, PETRI_TRANSITIONS=30} [2022-12-13 00:53:39,298 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2022-12-13 00:53:39,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:39,299 INFO L89 Accepts]: Start accepts. Operand has 65 places, 30 transitions, 70 flow [2022-12-13 00:53:39,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:39,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:39,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 30 transitions, 70 flow [2022-12-13 00:53:39,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 70 flow [2022-12-13 00:53:39,306 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 00:53:39,306 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:39,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:53:39,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 70 flow [2022-12-13 00:53:39,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 00:53:39,452 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:39,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 00:53:39,453 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2022-12-13 00:53:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:39,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:39,453 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:39,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:53:39,454 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 00:53:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:39,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1917319313, now seen corresponding path program 1 times [2022-12-13 00:53:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:39,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314793029] [2022-12-13 00:53:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:39,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:39,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314793029] [2022-12-13 00:53:39,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314793029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:39,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:39,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:53:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917730057] [2022-12-13 00:53:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:39,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:53:39,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:39,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:39,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:53:39,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:39,945 INFO L130 PetriNetUnfolder]: 1099/1829 cut-off events. [2022-12-13 00:53:39,945 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-13 00:53:39,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 1829 events. 1099/1829 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9250 event pairs, 259 based on Foata normal form. 25/1542 useless extension candidates. Maximal degree in co-relation 3625. Up to 1316 conditions per place. [2022-12-13 00:53:39,953 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 29 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-13 00:53:39,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 154 flow [2022-12-13 00:53:39,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 00:53:39,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2022-12-13 00:53:39,954 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 3 states and 59 transitions. [2022-12-13 00:53:39,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 154 flow [2022-12-13 00:53:39,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:39,956 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 74 flow [2022-12-13 00:53:39,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-13 00:53:39,956 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -28 predicate places. [2022-12-13 00:53:39,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:39,957 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 74 flow [2022-12-13 00:53:39,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:39,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:39,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 74 flow [2022-12-13 00:53:39,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 74 flow [2022-12-13 00:53:39,962 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 00:53:39,962 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:39,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 70 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:53:39,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 74 flow [2022-12-13 00:53:39,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 00:53:39,982 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:39,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 00:53:39,983 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 74 flow [2022-12-13 00:53:39,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:39,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:39,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:39,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:53:39,984 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 00:53:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash -692641281, now seen corresponding path program 1 times [2022-12-13 00:53:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:39,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251422749] [2022-12-13 00:53:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:41,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:41,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251422749] [2022-12-13 00:53:41,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251422749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:41,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:41,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434349666] [2022-12-13 00:53:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:41,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:41,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:41,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:53:41,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:41,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:41,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:53:41,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:41,390 INFO L130 PetriNetUnfolder]: 1181/1951 cut-off events. [2022-12-13 00:53:41,391 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-13 00:53:41,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 1951 events. 1181/1951 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10075 event pairs, 324 based on Foata normal form. 40/1661 useless extension candidates. Maximal degree in co-relation 3994. Up to 1404 conditions per place. [2022-12-13 00:53:41,398 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 42 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2022-12-13 00:53:41,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 237 flow [2022-12-13 00:53:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 00:53:41,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2022-12-13 00:53:41,402 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 74 flow. Second operand 5 states and 97 transitions. [2022-12-13 00:53:41,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 237 flow [2022-12-13 00:53:41,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:41,404 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 123 flow [2022-12-13 00:53:41,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-13 00:53:41,406 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -23 predicate places. [2022-12-13 00:53:41,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:41,406 INFO L89 Accepts]: Start accepts. Operand has 45 places, 36 transitions, 123 flow [2022-12-13 00:53:41,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:41,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:41,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 123 flow [2022-12-13 00:53:41,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 123 flow [2022-12-13 00:53:41,431 INFO L130 PetriNetUnfolder]: 66/171 cut-off events. [2022-12-13 00:53:41,431 INFO L131 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2022-12-13 00:53:41,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 171 events. 66/171 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 813 event pairs, 32 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 340. Up to 101 conditions per place. [2022-12-13 00:53:41,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 123 flow [2022-12-13 00:53:41,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-13 00:53:41,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L801: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_291 256))) (not (= (mod v_~x$w_buff0_used~0_315 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff1_thd2~0_66 v_~x$r_buff0_thd2~0_88) (= v_~x$r_buff1_thd1~0_93 v_~x$r_buff0_thd1~0_87) (= v_~x$w_buff0~0_193 v_~x$w_buff1~0_181) (= v_~x$r_buff0_thd2~0_87 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$w_buff0_used~0_316 v_~x$w_buff1_used~0_291) (= v_~x$w_buff0_used~0_315 1) (= v_~x$r_buff1_thd0~0_46 v_~x$r_buff0_thd0~0_50) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$r_buff0_thd3~0_127 v_~x$r_buff1_thd3~0_125) (= v_~x$w_buff0~0_192 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_193, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_316} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_192, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_181, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_125, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_66, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_291, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_93, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_315, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} 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] and [689] L762-->L780: Formula: (let ((.cse8 (= (mod v_~x$w_buff1_used~0_212 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd1~0_59 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_236 256) 0)) (.cse2 (= (mod v_~x$r_buff0_thd1~0_56 256) 0))) (let ((.cse12 (= (mod v_~weak$$choice2~0_82 256) 0)) (.cse5 (not .cse2)) (.cse9 (not .cse16)) (.cse4 (and .cse2 .cse11)) (.cse15 (and .cse8 .cse2)) (.cse14 (select |v_#memory_int_242| |v_~#x~0.base_164|))) (let ((.cse6 (select .cse14 |v_~#x~0.offset_164|)) (.cse7 (or .cse4 .cse15 .cse16)) (.cse10 (and .cse5 .cse9)) (.cse1 (= (mod v_~x$w_buff1_used~0_211 256) 0)) (.cse0 (not .cse12)) (.cse3 (= (mod v_~x$w_buff0_used~0_235 256) 0))) (and (= v_~x$w_buff1~0_116 v_~x$w_buff1~0_115) (= v_~x$r_buff0_thd1~0_55 (ite .cse0 v_~x$r_buff0_thd1~0_56 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd1~0_56 (ite (and .cse5 (not .cse3)) 0 v_~x$r_buff0_thd1~0_56)))) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_72) (or (and (= .cse6 |v_P0_#t~mem6_44|) .cse7 (= v_~__unbuffered_p0_EAX~0_22 |v_P0_#t~mem6_44|)) (and (or .cse5 (not .cse8)) .cse9 (= (ite .cse10 v_~x$w_buff0~0_131 v_~x$w_buff1~0_116) v_~__unbuffered_p0_EAX~0_22) (= |v_P0Thread1of1ForFork2_#t~mem6_1| |v_P0_#t~mem6_44|) (or .cse5 (not .cse11)))) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_82) (= v_~x$w_buff0~0_131 v_~x$w_buff0~0_130) (= v_~x$flush_delayed~0_58 0) (= v_~x$mem_tmp~0_30 .cse6) (= (ite .cse0 v_~x$w_buff0_used~0_236 (ite .cse7 v_~x$w_buff0_used~0_236 (ite .cse10 0 v_~x$w_buff0_used~0_236))) v_~x$w_buff0_used~0_235) (or (and (= v_~__unbuffered_p0_EAX~0_22 |v_P0_#t~mem9_24|) .cse12 (= |v_P0_#t~ite10_25| |v_P0_#t~mem9_24|)) (and .cse0 (= |v_P0_#t~ite10_25| v_~x$mem_tmp~0_30) (= |v_P0Thread1of1ForFork2_#t~mem9_1| |v_P0_#t~mem9_24|))) (= v_~x$r_buff1_thd1~0_58 (ite .cse0 v_~x$r_buff1_thd1~0_59 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_55 256) 0))) (or (and .cse13 .cse1) .cse3 (and .cse13 .cse11))) v_~x$r_buff1_thd1~0_59 0))) (= (store |v_#memory_int_242| |v_~#x~0.base_164| (store .cse14 |v_~#x~0.offset_164| |v_P0_#t~ite10_25|)) |v_#memory_int_240|) (= v_~x$w_buff1_used~0_211 (ite .cse0 v_~x$w_buff1_used~0_212 (ite (or .cse3 .cse4 .cse15) v_~x$w_buff1_used~0_212 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_131, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_56, ~#x~0.offset=|v_~#x~0.offset_164|, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_212, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_1|, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_236, #memory_int=|v_#memory_int_242|, ~#x~0.base=|v_~#x~0.base_164|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, ~#x~0.offset=|v_~#x~0.offset_164|, ~x$w_buff1~0=v_~x$w_buff1~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_211, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_1|, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_72, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_1|, #memory_int=|v_#memory_int_240|, ~#x~0.base=|v_~#x~0.base_164|, ~weak$$choice2~0=v_~weak$$choice2~0_82, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_1|} AuxVars[|v_P0_#t~mem6_44|, |v_P0_#t~mem9_24|, |v_P0_#t~ite10_25|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork2_#t~ite10] [2022-12-13 00:53:42,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L801: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_291 256))) (not (= (mod v_~x$w_buff0_used~0_315 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff1_thd2~0_66 v_~x$r_buff0_thd2~0_88) (= v_~x$r_buff1_thd1~0_93 v_~x$r_buff0_thd1~0_87) (= v_~x$w_buff0~0_193 v_~x$w_buff1~0_181) (= v_~x$r_buff0_thd2~0_87 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$w_buff0_used~0_316 v_~x$w_buff1_used~0_291) (= v_~x$w_buff0_used~0_315 1) (= v_~x$r_buff1_thd0~0_46 v_~x$r_buff0_thd0~0_50) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$r_buff0_thd3~0_127 v_~x$r_buff1_thd3~0_125) (= v_~x$w_buff0~0_192 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_193, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_316} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_192, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_181, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_125, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_66, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_291, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_93, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_315, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} 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] and [757] L3-1-->L877: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_47 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd0~0_43 256) 0)) (.cse3 (not .cse10)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_307 256) 0))) (.cse6 (= (mod v_~x$w_buff1_used~0_286 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_308 256) 0))) (let ((.cse4 (not .cse9)) (.cse1 (not .cse6)) (.cse0 (and .cse3 .cse11)) (.cse2 (not .cse7)) (.cse8 (select |v_#memory_int_327| |v_~#x~0.base_206|))) (and (= v_~x$w_buff1_used~0_285 (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_286)) (= v_~x$w_buff0_used~0_307 (ite (and .cse3 .cse4) 0 v_~x$w_buff0_used~0_308)) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~mem39#1_33| |v_ULTIMATE.start_main_#t~mem39#1_35|))) (or (and .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite40#1_34| |v_ULTIMATE.start_main_#t~ite40#1_32|) .cse5 (= |v_ULTIMATE.start_main_#t~ite41#1_39| v_~x$w_buff0~0_186)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_32| |v_ULTIMATE.start_main_#t~ite41#1_39|) (or (and (or .cse6 .cse7) (= |v_ULTIMATE.start_main_#t~mem39#1_33| (select .cse8 |v_~#x~0.offset_206|)) (= |v_ULTIMATE.start_main_#t~ite40#1_32| |v_ULTIMATE.start_main_#t~mem39#1_33|)) (and .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite40#1_32| v_~x$w_buff1~0_177) .cse5)) (or .cse9 .cse10)))) (= (ite .cse0 0 v_~x$r_buff0_thd0~0_47) v_~x$r_buff0_thd0~0_46) (= v_~x$r_buff1_thd0~0_42 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_46 256) 0)) .cse11) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_285 256) 0)))) 0 v_~x$r_buff1_thd0~0_43)) (= (store |v_#memory_int_327| |v_~#x~0.base_206| (store .cse8 |v_~#x~0.offset_206| |v_ULTIMATE.start_main_#t~ite41#1_39|)) |v_#memory_int_326|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_186, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_47, ~#x~0.offset=|v_~#x~0.offset_206|, ~x$w_buff1~0=v_~x$w_buff1~0_177, #memory_int=|v_#memory_int_327|, ~#x~0.base=|v_~#x~0.base_206|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_286, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_43, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_35|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_34|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_186, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_38|, ~#x~0.offset=|v_~#x~0.offset_206|, ~x$w_buff1~0=v_~x$w_buff1~0_177, #memory_int=|v_#memory_int_326|, ~#x~0.base=|v_~#x~0.base_206|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_285, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_307} AuxVars[|v_ULTIMATE.start_main_#t~mem39#1_33|, |v_ULTIMATE.start_main_#t~ite40#1_32|, |v_ULTIMATE.start_main_#t~ite41#1_39|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ~x$w_buff0_used~0] [2022-12-13 00:53:43,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L801: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_291 256))) (not (= (mod v_~x$w_buff0_used~0_315 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff1_thd2~0_66 v_~x$r_buff0_thd2~0_88) (= v_~x$r_buff1_thd1~0_93 v_~x$r_buff0_thd1~0_87) (= v_~x$w_buff0~0_193 v_~x$w_buff1~0_181) (= v_~x$r_buff0_thd2~0_87 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$w_buff0_used~0_316 v_~x$w_buff1_used~0_291) (= v_~x$w_buff0_used~0_315 1) (= v_~x$r_buff1_thd0~0_46 v_~x$r_buff0_thd0~0_50) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$r_buff0_thd3~0_127 v_~x$r_buff1_thd3~0_125) (= v_~x$w_buff0~0_192 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_193, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_316} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_192, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_181, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_125, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_66, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_291, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_93, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_315, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} 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] and [703] L837-->L844: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd3~0_90 256) 0))) (let ((.cse8 (= (mod v_~x$r_buff1_thd3~0_90 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_192 256) 0)) (.cse3 (not (= (mod v_~x$w_buff0_used~0_215 256) 0))) (.cse10 (not .cse5)) (.cse4 (= (mod v_~x$w_buff0_used~0_216 256) 0))) (let ((.cse1 (select |v_#memory_int_221| |v_~#x~0.base_152|)) (.cse11 (not .cse4)) (.cse0 (and .cse3 .cse10)) (.cse6 (not .cse9)) (.cse2 (not .cse8))) (and (= v_~x$r_buff0_thd3~0_89 (ite .cse0 0 v_~x$r_buff0_thd3~0_90)) (= |v_#memory_int_220| (store |v_#memory_int_221| |v_~#x~0.base_152| (store .cse1 |v_~#x~0.offset_152| |v_P2_#t~ite32_33|))) (= v_~x$r_buff1_thd3~0_89 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_191 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_89 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_90)) (let ((.cse7 (= |v_P2_#t~mem30_32| |v_P2Thread1of1ForFork1_#t~mem30_1|))) (or (and (or .cse4 .cse5) (or (and .cse6 .cse7 (= |v_P2_#t~ite31_29| v_~x$w_buff1~0_97) .cse2) (and (= |v_P2_#t~ite31_29| |v_P2_#t~mem30_32|) (or .cse8 .cse9) (= (select .cse1 |v_~#x~0.offset_152|) |v_P2_#t~mem30_32|))) (= |v_P2_#t~ite31_29| |v_P2_#t~ite32_33|)) (and (= |v_P2_#t~ite32_33| v_~x$w_buff0~0_112) .cse10 .cse7 (= |v_P2_#t~ite31_29| |v_P2Thread1of1ForFork1_#t~ite31_1|) .cse11))) (= v_~x$w_buff0_used~0_215 (ite (and .cse10 .cse11) 0 v_~x$w_buff0_used~0_216)) (= (ite (or .cse0 (and .cse6 .cse2)) 0 v_~x$w_buff1_used~0_192) v_~x$w_buff1_used~0_191))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_112, ~#x~0.offset=|v_~#x~0.offset_152|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, #memory_int=|v_#memory_int_221|, ~#x~0.base=|v_~#x~0.base_152|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_90, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_90, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_112, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~#x~0.offset=|v_~#x~0.offset_152|, ~x$w_buff1~0=v_~x$w_buff1~0_97, #memory_int=|v_#memory_int_220|, ~#x~0.base=|v_~#x~0.base_152|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_89, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_191, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_215} AuxVars[|v_P2_#t~ite32_33|, |v_P2_#t~ite31_29|, |v_P2_#t~mem30_32|] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~mem30, ~x$w_buff0_used~0] [2022-12-13 00:53:43,569 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:43,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2164 [2022-12-13 00:53:43,570 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 131 flow [2022-12-13 00:53:43,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:43,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:43,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:53:43,571 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 00:53:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2895503, now seen corresponding path program 1 times [2022-12-13 00:53:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:43,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546920320] [2022-12-13 00:53:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:43,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546920320] [2022-12-13 00:53:43,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546920320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:43,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:43,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:53:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312357075] [2022-12-13 00:53:43,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:43,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:43,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:43,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:43,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2022-12-13 00:53:43,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:43,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:43,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2022-12-13 00:53:43,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:44,042 INFO L130 PetriNetUnfolder]: 1609/2456 cut-off events. [2022-12-13 00:53:44,042 INFO L131 PetriNetUnfolder]: For 1307/1307 co-relation queries the response was YES. [2022-12-13 00:53:44,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6606 conditions, 2456 events. 1609/2456 cut-off events. For 1307/1307 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11929 event pairs, 460 based on Foata normal form. 27/1749 useless extension candidates. Maximal degree in co-relation 6592. Up to 2314 conditions per place. [2022-12-13 00:53:44,056 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 42 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2022-12-13 00:53:44,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 321 flow [2022-12-13 00:53:44,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 00:53:44,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2022-12-13 00:53:44,057 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 131 flow. Second operand 3 states and 69 transitions. [2022-12-13 00:53:44,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 321 flow [2022-12-13 00:53:44,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:53:44,059 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 193 flow [2022-12-13 00:53:44,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2022-12-13 00:53:44,060 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -22 predicate places. [2022-12-13 00:53:44,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:44,060 INFO L89 Accepts]: Start accepts. Operand has 46 places, 44 transitions, 193 flow [2022-12-13 00:53:44,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:44,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:44,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 44 transitions, 193 flow [2022-12-13 00:53:44,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 44 transitions, 193 flow [2022-12-13 00:53:44,152 INFO L130 PetriNetUnfolder]: 604/1113 cut-off events. [2022-12-13 00:53:44,153 INFO L131 PetriNetUnfolder]: For 173/180 co-relation queries the response was YES. [2022-12-13 00:53:44,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 1113 events. 604/1113 cut-off events. For 173/180 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 7314 event pairs, 240 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 2427. Up to 784 conditions per place. [2022-12-13 00:53:44,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 44 transitions, 193 flow [2022-12-13 00:53:44,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 636 [2022-12-13 00:53:44,162 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:44,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 00:53:44,162 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 193 flow [2022-12-13 00:53:44,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:44,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:44,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:44,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:53:44,163 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 00:53:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:44,163 INFO L85 PathProgramCache]: Analyzing trace with hash -220052766, now seen corresponding path program 1 times [2022-12-13 00:53:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:44,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178620765] [2022-12-13 00:53:44,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178620765] [2022-12-13 00:53:44,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178620765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:44,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:44,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59744055] [2022-12-13 00:53:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:44,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:44,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2022-12-13 00:53:44,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:44,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:44,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2022-12-13 00:53:44,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:44,518 INFO L130 PetriNetUnfolder]: 862/1499 cut-off events. [2022-12-13 00:53:44,518 INFO L131 PetriNetUnfolder]: For 730/730 co-relation queries the response was YES. [2022-12-13 00:53:44,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4821 conditions, 1499 events. 862/1499 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7839 event pairs, 127 based on Foata normal form. 81/1146 useless extension candidates. Maximal degree in co-relation 4805. Up to 1054 conditions per place. [2022-12-13 00:53:44,525 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 50 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2022-12-13 00:53:44,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 462 flow [2022-12-13 00:53:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 00:53:44,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2022-12-13 00:53:44,527 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 193 flow. Second operand 4 states and 92 transitions. [2022-12-13 00:53:44,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 462 flow [2022-12-13 00:53:44,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:53:44,530 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 295 flow [2022-12-13 00:53:44,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=49, PETRI_TRANSITIONS=53} [2022-12-13 00:53:44,531 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2022-12-13 00:53:44,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:44,531 INFO L89 Accepts]: Start accepts. Operand has 49 places, 53 transitions, 295 flow [2022-12-13 00:53:44,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:44,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:44,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 53 transitions, 295 flow [2022-12-13 00:53:44,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 53 transitions, 295 flow [2022-12-13 00:53:44,590 INFO L130 PetriNetUnfolder]: 331/729 cut-off events. [2022-12-13 00:53:44,590 INFO L131 PetriNetUnfolder]: For 188/264 co-relation queries the response was YES. [2022-12-13 00:53:44,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 729 events. 331/729 cut-off events. For 188/264 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 5040 event pairs, 60 based on Foata normal form. 6/470 useless extension candidates. Maximal degree in co-relation 2181. Up to 442 conditions per place. [2022-12-13 00:53:44,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 53 transitions, 295 flow [2022-12-13 00:53:44,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-13 00:53:44,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [854] L866-3-->L3-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [860] $Ultimate##0-->L877: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_130 256) 0))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_576 256) 0))) (.cse0 (not .cse4))) (let ((.cse5 (select |v_#memory_int_625| |v_~#x~0.base_311|)) (.cse3 (and .cse1 .cse0)) (.cse2 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (and (= v_~x$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_537 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd0~0_129 256) 0)) .cse1)) 0 v_~x$r_buff0_thd0~0_130)) (= |v_P1Thread1of1ForFork0_~arg#1.base_28| |v_P1Thread1of1ForFork0_#in~arg#1.base_28|) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|) (= v_~x$r_buff0_thd2~0_155 1) (= v_~x$r_buff0_thd0~0_129 (ite .cse3 0 v_~x$r_buff0_thd0~0_130)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34| 0)) (= v_~x$r_buff0_thd1~0_237 v_~x$r_buff1_thd1~0_243) (= v_~x$w_buff0~0_399 v_~x$w_buff1~0_373) (or (and .cse4 (= |v_ULTIMATE.start_main_#t~ite41#1_112| |v_ULTIMATE.start_main_#t~ite40#1_119|) (= |v_ULTIMATE.start_main_#t~mem39#1_120| |v_ULTIMATE.start_main_#t~ite40#1_119|) (= |v_ULTIMATE.start_main_#t~mem39#1_120| (select .cse5 |v_~#x~0.offset_311|))) (and (= |v_ULTIMATE.start_main_#t~mem39#1_122| |v_ULTIMATE.start_main_#t~mem39#1_120|) (= |v_ULTIMATE.start_main_#t~ite41#1_112| v_~x$w_buff0~0_398) .cse0 (= |v_ULTIMATE.start_main_#t~ite40#1_119| |v_ULTIMATE.start_main_#t~ite40#1_121|))) (= (ite .cse0 0 1) v_~x$w_buff0_used~0_576) (= v_~x$r_buff0_thd2~0_156 v_~x$r_buff1_thd2~0_115) (= (store |v_#memory_int_625| |v_~#x~0.base_311| (store .cse5 |v_~#x~0.offset_311| |v_ULTIMATE.start_main_#t~ite41#1_112|)) |v_#memory_int_624|) (= v_~x$w_buff1_used~0_537 (ite (or .cse3 (and (not .cse2) .cse0)) 0 v_~x$w_buff0_used~0_578)) (= v_~x$r_buff0_thd3~0_220 v_~x$r_buff1_thd3~0_208) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_28| |v_P1Thread1of1ForFork0_~arg#1.offset_28|) (= v_~x$w_buff0~0_398 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_399, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_237, ~#x~0.offset=|v_~#x~0.offset_311|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_220, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_156, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_28|, #memory_int=|v_#memory_int_625|, ~#x~0.base=|v_~#x~0.base_311|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_122|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_121|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_398, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_129, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_237, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_28|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_28|, ~#x~0.offset=|v_~#x~0.offset_311|, ~x$w_buff1~0=v_~x$w_buff1~0_373, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_537, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_208, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_243, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_220, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_155, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_576, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_28|, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_111|, #memory_int=|v_#memory_int_624|, ~#x~0.base=|v_~#x~0.base_311|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_119|, |v_ULTIMATE.start_main_#t~ite41#1_112|, |v_ULTIMATE.start_main_#t~mem39#1_120|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41#1, #memory_int, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1] [2022-12-13 00:53:44,973 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:44,974 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 443 [2022-12-13 00:53:44,974 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 299 flow [2022-12-13 00:53:44,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:44,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:44,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:44,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:53:44,974 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 00:53:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1584803847, now seen corresponding path program 1 times [2022-12-13 00:53:44,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:44,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764527378] [2022-12-13 00:53:44,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:45,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764527378] [2022-12-13 00:53:45,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764527378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:45,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:45,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029145227] [2022-12-13 00:53:45,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:45,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:45,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2022-12-13 00:53:45,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 53 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 00:53:45,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:45,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2022-12-13 00:53:45,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:45,307 INFO L130 PetriNetUnfolder]: 466/878 cut-off events. [2022-12-13 00:53:45,307 INFO L131 PetriNetUnfolder]: For 569/569 co-relation queries the response was YES. [2022-12-13 00:53:45,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 878 events. 466/878 cut-off events. For 569/569 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4382 event pairs, 46 based on Foata normal form. 90/696 useless extension candidates. Maximal degree in co-relation 3293. Up to 430 conditions per place. [2022-12-13 00:53:45,312 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 40 selfloop transitions, 28 changer transitions 0/74 dead transitions. [2022-12-13 00:53:45,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 518 flow [2022-12-13 00:53:45,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 00:53:45,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5764705882352941 [2022-12-13 00:53:45,313 INFO L175 Difference]: Start difference. First operand has 49 places, 53 transitions, 299 flow. Second operand 5 states and 98 transitions. [2022-12-13 00:53:45,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 518 flow [2022-12-13 00:53:45,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 457 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 00:53:45,317 INFO L231 Difference]: Finished difference. Result has 50 places, 52 transitions, 310 flow [2022-12-13 00:53:45,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=50, PETRI_TRANSITIONS=52} [2022-12-13 00:53:45,317 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -18 predicate places. [2022-12-13 00:53:45,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:45,317 INFO L89 Accepts]: Start accepts. Operand has 50 places, 52 transitions, 310 flow [2022-12-13 00:53:45,318 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:45,318 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:45,318 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 52 transitions, 310 flow [2022-12-13 00:53:45,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 52 transitions, 310 flow [2022-12-13 00:53:45,343 INFO L130 PetriNetUnfolder]: 133/369 cut-off events. [2022-12-13 00:53:45,343 INFO L131 PetriNetUnfolder]: For 161/219 co-relation queries the response was YES. [2022-12-13 00:53:45,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 369 events. 133/369 cut-off events. For 161/219 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2268 event pairs, 6 based on Foata normal form. 1/186 useless extension candidates. Maximal degree in co-relation 1172. Up to 235 conditions per place. [2022-12-13 00:53:45,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 52 transitions, 310 flow [2022-12-13 00:53:45,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-13 00:53:46,470 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:53:46,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1154 [2022-12-13 00:53:46,471 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 306 flow [2022-12-13 00:53:46,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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 00:53:46,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:46,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:46,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:53:46,472 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 00:53:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1467519864, now seen corresponding path program 1 times [2022-12-13 00:53:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:46,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825717121] [2022-12-13 00:53:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:46,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825717121] [2022-12-13 00:53:46,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825717121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:46,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:46,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247819420] [2022-12-13 00:53:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:46,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:46,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:46,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:46,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:53:46,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:46,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:46,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:53:46,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:46,846 INFO L130 PetriNetUnfolder]: 619/1108 cut-off events. [2022-12-13 00:53:46,846 INFO L131 PetriNetUnfolder]: For 1517/1598 co-relation queries the response was YES. [2022-12-13 00:53:46,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 1108 events. 619/1108 cut-off events. For 1517/1598 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6132 event pairs, 18 based on Foata normal form. 70/939 useless extension candidates. Maximal degree in co-relation 4283. Up to 556 conditions per place. [2022-12-13 00:53:46,851 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 47 selfloop transitions, 1 changer transitions 33/94 dead transitions. [2022-12-13 00:53:46,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 748 flow [2022-12-13 00:53:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 00:53:46,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6693548387096774 [2022-12-13 00:53:46,852 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 306 flow. Second operand 4 states and 83 transitions. [2022-12-13 00:53:46,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 748 flow [2022-12-13 00:53:46,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 94 transitions, 614 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:46,860 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 237 flow [2022-12-13 00:53:46,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-13 00:53:46,860 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -18 predicate places. [2022-12-13 00:53:46,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:46,860 INFO L89 Accepts]: Start accepts. Operand has 50 places, 49 transitions, 237 flow [2022-12-13 00:53:46,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:46,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:46,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 49 transitions, 237 flow [2022-12-13 00:53:46,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 49 transitions, 237 flow [2022-12-13 00:53:46,886 INFO L130 PetriNetUnfolder]: 144/348 cut-off events. [2022-12-13 00:53:46,886 INFO L131 PetriNetUnfolder]: For 254/259 co-relation queries the response was YES. [2022-12-13 00:53:46,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 348 events. 144/348 cut-off events. For 254/259 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2038 event pairs, 7 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 964. Up to 172 conditions per place. [2022-12-13 00:53:46,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 49 transitions, 237 flow [2022-12-13 00:53:46,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 00:53:47,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [738] $Ultimate##0-->L762: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_9 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_9, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] and [859] $Ultimate##0-->L780: Formula: (let ((.cse10 (= (mod v_~weak$$choice2~0_193 256) 0)) (.cse0 (= (mod v_~x$w_buff0_used~0_572 256) 0)) (.cse8 (select |v_#memory_int_621| |v_~#x~0.base_309|)) (.cse2 (= (mod v_~x$r_buff0_thd1~0_234 256) 0))) (let ((.cse3 (= (mod v_~x$w_buff1_used~0_533 256) 0)) (.cse5 (not .cse2)) (.cse7 (select .cse8 |v_~#x~0.offset_309|)) (.cse9 (and .cse2 .cse0)) (.cse4 (= (mod v_~x$w_buff0_used~0_570 256) 0)) (.cse1 (not .cse10))) (and (= v_~x$w_buff0~0_394 v_~x$w_buff1~0_369) (= v_~weak$$choice2~0_193 |v_P0Thread1of1ForFork2_#t~nondet4_148|) (= v_~x$r_buff0_thd0~0_127 v_~x$r_buff1_thd0~0_129) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_26| |v_P1Thread1of1ForFork0_~arg#1.offset_26|) (= |v_P1Thread1of1ForFork0_~arg#1.base_26| |v_P1Thread1of1ForFork0_#in~arg#1.base_26|) (= (ite .cse0 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= v_~x$r_buff0_thd1~0_233 (ite .cse1 v_~x$r_buff0_thd1~0_234 (ite (or .cse2 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_234 (ite (and .cse5 (not .cse4)) 0 v_~x$r_buff0_thd1~0_234)))) (= v_~weak$$choice0~0_185 |v_P0Thread1of1ForFork2_#t~nondet3_148|) (= v_~x$r_buff1_thd1~0_239 (ite .cse1 v_~x$r_buff0_thd1~0_234 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd1~0_233 256) 0))) (or (and .cse3 .cse6) (and .cse2 .cse6) .cse4)) v_~x$r_buff0_thd1~0_234 0))) (= .cse7 v_~x$mem_tmp~0_137) (= (store |v_#memory_int_621| |v_~#x~0.base_309| (store .cse8 |v_~#x~0.offset_309| |v_P0_#t~ite10_99|)) |v_#memory_int_620|) (= v_~x$r_buff0_thd3~0_218 v_~x$r_buff1_thd3~0_206) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| 0)) (= v_~x$r_buff0_thd2~0_152 v_~x$r_buff1_thd2~0_113) (= v_~x$r_buff0_thd2~0_151 1) (= v_~x$w_buff0_used~0_570 (ite .cse1 1 (ite (or .cse2 .cse9) 1 (ite .cse5 0 1)))) (or (and .cse5 (= (ite .cse5 v_~x$w_buff0~0_392 v_~x$w_buff0~0_394) v_~__unbuffered_p0_EAX~0_139) (= |v_P0Thread1of1ForFork2_#t~mem6_148| |v_P0_#t~mem6_118|)) (and (= v_~__unbuffered_p0_EAX~0_139 |v_P0_#t~mem6_118|) .cse2 (= .cse7 |v_P0_#t~mem6_118|))) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= (ite .cse1 v_~x$w_buff0_used~0_572 (ite (or .cse2 .cse9 .cse4) v_~x$w_buff0_used~0_572 0)) v_~x$w_buff1_used~0_533) (= v_~x$w_buff0~0_392 1) (= v_~x$flush_delayed~0_171 0) (or (and (= |v_P0Thread1of1ForFork2_#t~mem9_148| |v_P0_#t~mem9_98|) .cse1 (= |v_P0_#t~ite10_99| v_~x$mem_tmp~0_137)) (and .cse10 (= |v_P0_#t~ite10_99| |v_P0_#t~mem9_98|) (= v_~__unbuffered_p0_EAX~0_139 |v_P0_#t~mem9_98|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_394, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_234, ~#x~0.offset=|v_~#x~0.offset_309|, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_148|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_218, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_148|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_152, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_26|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_572, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_26|, #memory_int=|v_#memory_int_621|, ~#x~0.base=|v_~#x~0.base_309|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_148|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_148|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_233, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_26|, ~x$flush_delayed~0=v_~x$flush_delayed~0_171, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_206, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_239, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_76|, ~x$mem_tmp~0=v_~x$mem_tmp~0_137, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_218, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_26|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_76|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_26|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_76|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_26|, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_369, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_533, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_151, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_570, ~weak$$choice0~0=v_~weak$$choice0~0_185, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_76|, #memory_int=|v_#memory_int_620|, ~#x~0.base=|v_~#x~0.base_309|, ~weak$$choice2~0=v_~weak$$choice2~0_193} AuxVars[|v_P0_#t~mem9_98|, |v_P0_#t~ite10_99|, |v_P0_#t~mem6_118|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3] [2022-12-13 00:53:47,873 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:47,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1014 [2022-12-13 00:53:47,874 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 238 flow [2022-12-13 00:53:47,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:47,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:47,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:47,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:53:47,874 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 00:53:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 918188459, now seen corresponding path program 1 times [2022-12-13 00:53:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:47,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807406344] [2022-12-13 00:53:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:48,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:48,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807406344] [2022-12-13 00:53:48,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807406344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:48,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:48,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032987786] [2022-12-13 00:53:48,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:48,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:48,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:48,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 00:53:48,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 238 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 00:53:48,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:48,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 00:53:48,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:48,826 INFO L130 PetriNetUnfolder]: 900/1718 cut-off events. [2022-12-13 00:53:48,827 INFO L131 PetriNetUnfolder]: For 2527/2655 co-relation queries the response was YES. [2022-12-13 00:53:48,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5814 conditions, 1718 events. 900/1718 cut-off events. For 2527/2655 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 11370 event pairs, 27 based on Foata normal form. 141/1421 useless extension candidates. Maximal degree in co-relation 5796. Up to 655 conditions per place. [2022-12-13 00:53:48,833 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 73 selfloop transitions, 13 changer transitions 51/151 dead transitions. [2022-12-13 00:53:48,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 151 transitions, 1061 flow [2022-12-13 00:53:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:53:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:53:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2022-12-13 00:53:48,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6077586206896551 [2022-12-13 00:53:48,834 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 238 flow. Second operand 8 states and 141 transitions. [2022-12-13 00:53:48,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 151 transitions, 1061 flow [2022-12-13 00:53:48,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 151 transitions, 1052 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:48,847 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 326 flow [2022-12-13 00:53:48,847 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2022-12-13 00:53:48,848 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -12 predicate places. [2022-12-13 00:53:48,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:48,848 INFO L89 Accepts]: Start accepts. Operand has 56 places, 56 transitions, 326 flow [2022-12-13 00:53:48,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:48,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:48,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 326 flow [2022-12-13 00:53:48,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 56 transitions, 326 flow [2022-12-13 00:53:48,892 INFO L130 PetriNetUnfolder]: 310/676 cut-off events. [2022-12-13 00:53:48,892 INFO L131 PetriNetUnfolder]: For 1030/1091 co-relation queries the response was YES. [2022-12-13 00:53:48,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 676 events. 310/676 cut-off events. For 1030/1091 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 4425 event pairs, 5 based on Foata normal form. 14/291 useless extension candidates. Maximal degree in co-relation 2073. Up to 361 conditions per place. [2022-12-13 00:53:48,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 56 transitions, 326 flow [2022-12-13 00:53:48,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 00:53:48,897 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:48,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 00:53:48,898 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 326 flow [2022-12-13 00:53:48,898 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 00:53:48,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:48,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:48,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:53:48,898 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 00:53:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash 354789181, now seen corresponding path program 1 times [2022-12-13 00:53:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:48,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720109441] [2022-12-13 00:53:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:48,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:53:48,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:53:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:53:49,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:53:49,008 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:53:49,009 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:53:49,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:53:49,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:53:49,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:53:49,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:53:49,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:53:49,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:53:49,011 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:49,014 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:53:49,014 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:53:49,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:53:49 BasicIcfg [2022-12-13 00:53:49,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:53:49,066 INFO L158 Benchmark]: Toolchain (without parser) took 20395.93ms. Allocated memory was 199.2MB in the beginning and 694.2MB in the end (delta: 494.9MB). Free memory was 174.3MB in the beginning and 240.4MB in the end (delta: -66.2MB). Peak memory consumption was 428.2MB. Max. memory is 8.0GB. [2022-12-13 00:53:49,066 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:53:49,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.18ms. Allocated memory is still 199.2MB. Free memory was 174.3MB in the beginning and 145.8MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 00:53:49,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.15ms. Allocated memory is still 199.2MB. Free memory was 145.8MB in the beginning and 143.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:53:49,066 INFO L158 Benchmark]: Boogie Preprocessor took 36.12ms. Allocated memory is still 199.2MB. Free memory was 143.3MB in the beginning and 140.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:53:49,067 INFO L158 Benchmark]: RCFGBuilder took 824.29ms. Allocated memory was 199.2MB in the beginning and 264.2MB in the end (delta: 65.0MB). Free memory was 140.7MB in the beginning and 208.1MB in the end (delta: -67.4MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-13 00:53:49,067 INFO L158 Benchmark]: TraceAbstraction took 19088.60ms. Allocated memory was 264.2MB in the beginning and 694.2MB in the end (delta: 429.9MB). Free memory was 207.0MB in the beginning and 240.4MB in the end (delta: -33.4MB). Peak memory consumption was 396.0MB. Max. memory is 8.0GB. [2022-12-13 00:53:49,068 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.18ms. Allocated memory is still 199.2MB. Free memory was 174.3MB in the beginning and 145.8MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.15ms. Allocated memory is still 199.2MB. Free memory was 145.8MB in the beginning and 143.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.12ms. Allocated memory is still 199.2MB. Free memory was 143.3MB in the beginning and 140.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 824.29ms. Allocated memory was 199.2MB in the beginning and 264.2MB in the end (delta: 65.0MB). Free memory was 140.7MB in the beginning and 208.1MB in the end (delta: -67.4MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19088.60ms. Allocated memory was 264.2MB in the beginning and 694.2MB in the end (delta: 429.9MB). Free memory was 207.0MB in the beginning and 240.4MB in the end (delta: -33.4MB). Peak memory consumption was 396.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 130 PlacesBefore, 68 PlacesAfterwards, 122 TransitionsBefore, 59 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2852, independent: 2708, independent conditional: 2708, independent unconditional: 0, dependent: 144, dependent conditional: 144, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2852, independent: 2708, independent conditional: 0, independent unconditional: 2708, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2852, independent: 2708, independent conditional: 0, independent unconditional: 2708, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2852, independent: 2708, independent conditional: 0, independent unconditional: 2708, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1507, independent: 1459, independent conditional: 0, independent unconditional: 1459, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1507, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 324, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 300, dependent conditional: 0, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2852, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 1507, unknown conditional: 0, unknown unconditional: 1507] , Statistics on independence cache: Total cache size (in pairs): 2977, Positive cache size: 2929, Positive conditional cache size: 0, Positive unconditional cache size: 2929, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 134, independent conditional: 9, independent unconditional: 125, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 134, independent conditional: 9, independent unconditional: 125, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 134, independent conditional: 9, independent unconditional: 125, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 143, independent: 121, independent conditional: 9, independent unconditional: 112, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 143, independent: 103, independent conditional: 0, independent unconditional: 103, 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: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 141, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 130, dependent conditional: 7, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 143, unknown conditional: 10, unknown unconditional: 133] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 121, Positive conditional cache size: 9, Positive unconditional cache size: 112, Negative cache size: 22, Negative conditional cache size: 1, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 158, independent: 130, independent conditional: 1, independent unconditional: 129, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 158, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 9, Positive unconditional cache size: 121, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 45 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 120, independent conditional: 120, 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: 134, independent: 120, independent conditional: 56, independent unconditional: 64, 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: 134, independent: 120, independent conditional: 56, independent unconditional: 64, 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: 134, independent: 120, independent conditional: 56, independent unconditional: 64, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 110, independent conditional: 53, independent unconditional: 57, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 11, unknown conditional: 3, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 158, Positive conditional cache size: 12, Positive unconditional cache size: 146, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 10, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 44, independent conditional: 10, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 10, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 42, independent conditional: 10, independent unconditional: 32, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 160, Positive conditional cache size: 12, Positive unconditional cache size: 148, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 49 PlacesBefore, 49 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 106, independent: 94, independent conditional: 37, independent unconditional: 57, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 94, independent conditional: 37, independent unconditional: 57, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 94, independent conditional: 37, independent unconditional: 57, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 5, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 84, independent conditional: 32, independent unconditional: 52, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 173, Positive conditional cache size: 17, Positive unconditional cache size: 156, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 50 PlacesBefore, 48 PlacesAfterwards, 52 TransitionsBefore, 50 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 36, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 84, independent conditional: 36, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 36, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 96, independent: 80, independent conditional: 32, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 181, Positive conditional cache size: 21, Positive unconditional cache size: 160, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 48 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, 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: 52, independent: 52, independent conditional: 32, independent unconditional: 20, 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: 52, independent: 52, independent conditional: 32, independent unconditional: 20, 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: 52, independent: 52, independent conditional: 32, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 52, independent conditional: 32, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 191, Positive conditional cache size: 21, Positive unconditional cache size: 170, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 191, Positive conditional cache size: 21, Positive unconditional cache size: 170, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2449; [L862] FCALL, FORK 0 pthread_create(&t2449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2449, ((void *)0), P0, ((void *)0))=9, t2449={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2450; [L864] FCALL, FORK 0 pthread_create(&t2450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2450, ((void *)0), P1, ((void *)0))=10, t2449={6:0}, t2450={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L865] 0 pthread_t t2451; [L866] FCALL, FORK 0 pthread_create(&t2451, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2451, ((void *)0), P2, ((void *)0))=11, t2449={6:0}, t2450={7:0}, t2451={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 x$flush_delayed = weak$$choice2 [L820] EXPR 3 \read(x) [L820] 3 x$mem_tmp = x [L821] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] EXPR 3 \read(x) [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L823] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L824] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L825] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L826] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L828] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L829] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L830] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L831] EXPR 3 \read(x) [L831] 3 __unbuffered_p2_EAX = x [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] 3 x = x$flush_delayed ? x$mem_tmp : x [L833] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L836] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 1 y = 1 [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __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=9, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __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=9, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __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=9, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __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=9, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 \read(x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] 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) [L840] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L841] 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 [L842] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L843] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __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=9, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L846] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __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=9, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 \read(x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 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) [L873] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L874] 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 [L875] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L876] 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 [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L881] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 866]: 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, 150 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: 18.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 203 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 746 IncrementalHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 1 mSDtfsCounter, 746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=8, InterpolantAutomatonStates: 35, 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, 2.3s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 00:53:49,087 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...