/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:24:04,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:24:04,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:24:04,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:24:04,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:24:04,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:24:04,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:24:04,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:24:04,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:24:04,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:24:04,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:24:04,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:24:04,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:24:04,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:24:04,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:24:04,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:24:04,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:24:04,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:24:04,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:24:04,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:24:04,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:24:04,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:24:04,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:24:04,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:24:04,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:24:04,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:24:04,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:24:04,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:24:04,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:24:04,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:24:04,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:24:04,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:24:04,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:24:04,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:24:04,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:24:04,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:24:04,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:24:04,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:24:04,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:24:04,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:24:04,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:24:04,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:24:04,942 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:24:04,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:24:04,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:24:04,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:24:04,967 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:24:04,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:24:04,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:24:04,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:24:04,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:24:04,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:24:04,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:24:04,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:24:04,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:24:04,970 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:24:04,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:24:04,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:24:04,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:24:04,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:24:04,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:24:04,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:24:04,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:24:04,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:24:04,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:24:04,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:24:04,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:24:04,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:24:04,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:24:04,972 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:24:04,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:24:05,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:24:05,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:24:05,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:24:05,360 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:24:05,360 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:24:05,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 06:24:06,426 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:24:06,721 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:24:06,722 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 06:24:06,745 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f3f1ee5/73e6e54062a645fea0a21ef27edaffb1/FLAG9d7bb994c [2022-12-06 06:24:06,767 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f3f1ee5/73e6e54062a645fea0a21ef27edaffb1 [2022-12-06 06:24:06,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:24:06,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:24:06,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:24:06,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:24:06,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:24:06,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:24:06" (1/1) ... [2022-12-06 06:24:06,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2985ae1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:06, skipping insertion in model container [2022-12-06 06:24:06,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:24:06" (1/1) ... [2022-12-06 06:24:06,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:24:06,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:24:07,010 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-06 06:24:07,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:24:07,222 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:24:07,237 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-06 06:24:07,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:24:07,331 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:24:07,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07 WrapperNode [2022-12-06 06:24:07,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:24:07,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:24:07,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:24:07,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:24:07,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,372 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2022-12-06 06:24:07,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:24:07,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:24:07,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:24:07,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:24:07,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:24:07,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:24:07,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:24:07,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:24:07,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:24:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:24:07,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:24:07,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:24:07,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:24:07,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:24:07,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:24:07,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:24:07,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:24:07,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:24:07,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:24:07,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:24:07,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:24:07,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:24:07,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:24:07,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:24:07,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:24:07,514 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:24:07,681 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:24:07,683 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:24:08,023 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:24:08,161 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:24:08,161 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:24:08,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:24:08 BoogieIcfgContainer [2022-12-06 06:24:08,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:24:08,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:24:08,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:24:08,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:24:08,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:24:06" (1/3) ... [2022-12-06 06:24:08,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ff5551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:24:08, skipping insertion in model container [2022-12-06 06:24:08,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (2/3) ... [2022-12-06 06:24:08,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ff5551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:24:08, skipping insertion in model container [2022-12-06 06:24:08,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:24:08" (3/3) ... [2022-12-06 06:24:08,174 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 06:24:08,191 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:24:08,191 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:24:08,191 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:24:08,239 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:24:08,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-06 06:24:08,321 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-06 06:24:08,321 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:08,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 06:24:08,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-06 06:24:08,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-06 06:24:08,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:08,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-06 06:24:08,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-06 06:24:08,377 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-06 06:24:08,377 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:08,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 06:24:08,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-06 06:24:08,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-06 06:24:12,061 INFO L203 LiptonReduction]: Total number of compositions: 72 [2022-12-06 06:24:12,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:24:12,080 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;@1997dde4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:24:12,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:24:12,083 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:24:12,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:12,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:12,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:24:12,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:24:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 404667, now seen corresponding path program 1 times [2022-12-06 06:24:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:12,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959457671] [2022-12-06 06:24:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:12,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959457671] [2022-12-06 06:24:12,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959457671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:12,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:12,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:24:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370000269] [2022-12-06 06:24:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:12,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:24:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:12,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:24:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:24:12,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:24:12,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:12,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:12,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:24:12,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:12,564 INFO L130 PetriNetUnfolder]: 214/410 cut-off events. [2022-12-06 06:24:12,564 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:24:12,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 410 events. 214/410 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1816 event pairs, 25 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 785. Up to 307 conditions per place. [2022-12-06 06:24:12,570 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 23 selfloop transitions, 2 changer transitions 6/32 dead transitions. [2022-12-06 06:24:12,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 135 flow [2022-12-06 06:24:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:24:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:24:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 06:24:12,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-06 06:24:12,582 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 39 transitions. [2022-12-06 06:24:12,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 135 flow [2022-12-06 06:24:12,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:24:12,587 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2022-12-06 06:24:12,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2022-12-06 06:24:12,592 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-06 06:24:12,592 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:12,593 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 40 flow [2022-12-06 06:24:12,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:12,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:12,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 40 flow [2022-12-06 06:24:12,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-06 06:24:12,628 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:24:12,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:12,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:24:12,629 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-06 06:24:12,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:24:12,742 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:24:12,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 06:24:12,745 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-06 06:24:12,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:12,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:12,745 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:12,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:24:12,749 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:24:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 84158392, now seen corresponding path program 1 times [2022-12-06 06:24:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679725177] [2022-12-06 06:24:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:13,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679725177] [2022-12-06 06:24:13,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679725177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:13,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:13,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:24:13,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027994742] [2022-12-06 06:24:13,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:13,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:24:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:24:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:24:13,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:24:13,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:13,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:24:13,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:13,096 INFO L130 PetriNetUnfolder]: 140/249 cut-off events. [2022-12-06 06:24:13,097 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 06:24:13,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 249 events. 140/249 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 830 event pairs, 56 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 525. Up to 235 conditions per place. [2022-12-06 06:24:13,106 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-06 06:24:13,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 100 flow [2022-12-06 06:24:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:24:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:24:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 06:24:13,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 06:24:13,107 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 23 transitions. [2022-12-06 06:24:13,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 100 flow [2022-12-06 06:24:13,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:24:13,109 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2022-12-06 06:24:13,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-06 06:24:13,110 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -5 predicate places. [2022-12-06 06:24:13,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:13,110 INFO L89 Accepts]: Start accepts. Operand has 23 places, 17 transitions, 53 flow [2022-12-06 06:24:13,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:13,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:13,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-06 06:24:13,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 17 transitions, 53 flow [2022-12-06 06:24:13,115 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-06 06:24:13,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:13,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2022-12-06 06:24:13,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-06 06:24:13,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 06:24:13,189 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:24:13,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 06:24:13,191 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2022-12-06 06:24:13,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:13,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:13,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:24:13,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:24:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1686056336, now seen corresponding path program 1 times [2022-12-06 06:24:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:13,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628926208] [2022-12-06 06:24:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:13,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628926208] [2022-12-06 06:24:13,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628926208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:13,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:13,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:24:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707689091] [2022-12-06 06:24:13,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:13,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:24:13,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:13,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:24:13,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:24:13,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:24:13,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:13,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:24:13,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:13,510 INFO L130 PetriNetUnfolder]: 67/153 cut-off events. [2022-12-06 06:24:13,511 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-12-06 06:24:13,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 153 events. 67/153 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 530 event pairs, 13 based on Foata normal form. 24/176 useless extension candidates. Maximal degree in co-relation 338. Up to 68 conditions per place. [2022-12-06 06:24:13,512 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 26 selfloop transitions, 5 changer transitions 9/42 dead transitions. [2022-12-06 06:24:13,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 42 transitions, 194 flow [2022-12-06 06:24:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:24:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:24:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 06:24:13,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:24:13,521 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 5 states and 45 transitions. [2022-12-06 06:24:13,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 42 transitions, 194 flow [2022-12-06 06:24:13,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 42 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:24:13,523 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 87 flow [2022-12-06 06:24:13,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-06 06:24:13,524 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2022-12-06 06:24:13,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:13,525 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 87 flow [2022-12-06 06:24:13,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:13,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:13,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 87 flow [2022-12-06 06:24:13,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 87 flow [2022-12-06 06:24:13,537 INFO L130 PetriNetUnfolder]: 6/42 cut-off events. [2022-12-06 06:24:13,537 INFO L131 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2022-12-06 06:24:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 42 events. 6/42 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 2 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 86. Up to 12 conditions per place. [2022-12-06 06:24:13,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 87 flow [2022-12-06 06:24:13,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 06:24:13,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L820-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [386] L800-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-06 06:24:13,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:24:13,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 06:24:13,587 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 85 flow [2022-12-06 06:24:13,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:13,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:13,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:24:13,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:24:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash -659898499, now seen corresponding path program 1 times [2022-12-06 06:24:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:13,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947769889] [2022-12-06 06:24:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:13,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:13,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947769889] [2022-12-06 06:24:13,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947769889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:13,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:13,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:24:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575824986] [2022-12-06 06:24:13,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:24:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:13,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:24:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:24:13,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:24:13,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 85 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:13,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:24:13,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:13,822 INFO L130 PetriNetUnfolder]: 50/117 cut-off events. [2022-12-06 06:24:13,822 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 06:24:13,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 117 events. 50/117 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 11 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 343. Up to 92 conditions per place. [2022-12-06 06:24:13,823 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 21 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2022-12-06 06:24:13,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 154 flow [2022-12-06 06:24:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:24:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:24:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 06:24:13,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 06:24:13,825 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 85 flow. Second operand 3 states and 23 transitions. [2022-12-06 06:24:13,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 154 flow [2022-12-06 06:24:13,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 152 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:24:13,829 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 86 flow [2022-12-06 06:24:13,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-06 06:24:13,831 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2022-12-06 06:24:13,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:13,831 INFO L89 Accepts]: Start accepts. Operand has 31 places, 19 transitions, 86 flow [2022-12-06 06:24:13,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:13,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:13,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 19 transitions, 86 flow [2022-12-06 06:24:13,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 86 flow [2022-12-06 06:24:13,840 INFO L130 PetriNetUnfolder]: 4/32 cut-off events. [2022-12-06 06:24:13,841 INFO L131 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2022-12-06 06:24:13,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 32 events. 4/32 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 71. Up to 10 conditions per place. [2022-12-06 06:24:13,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 86 flow [2022-12-06 06:24:13,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-06 06:24:13,855 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:24:13,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 06:24:13,861 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 86 flow [2022-12-06 06:24:13,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:13,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:13,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:24:13,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:24:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1766545883, now seen corresponding path program 1 times [2022-12-06 06:24:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:13,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305093187] [2022-12-06 06:24:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:13,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305093187] [2022-12-06 06:24:14,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305093187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:14,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:14,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:24:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326625415] [2022-12-06 06:24:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:14,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:24:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:14,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:24:14,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:24:14,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:24:14,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:14,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:14,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:24:14,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:14,138 INFO L130 PetriNetUnfolder]: 25/72 cut-off events. [2022-12-06 06:24:14,138 INFO L131 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2022-12-06 06:24:14,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 72 events. 25/72 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 10 based on Foata normal form. 9/80 useless extension candidates. Maximal degree in co-relation 206. Up to 32 conditions per place. [2022-12-06 06:24:14,139 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 20 selfloop transitions, 6 changer transitions 6/34 dead transitions. [2022-12-06 06:24:14,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 200 flow [2022-12-06 06:24:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:24:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:24:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 06:24:14,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 06:24:14,142 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 86 flow. Second operand 6 states and 39 transitions. [2022-12-06 06:24:14,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 200 flow [2022-12-06 06:24:14,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 175 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 06:24:14,145 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 97 flow [2022-12-06 06:24:14,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2022-12-06 06:24:14,147 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2022-12-06 06:24:14,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:14,147 INFO L89 Accepts]: Start accepts. Operand has 34 places, 20 transitions, 97 flow [2022-12-06 06:24:14,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:14,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:14,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 97 flow [2022-12-06 06:24:14,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 20 transitions, 97 flow [2022-12-06 06:24:14,155 INFO L130 PetriNetUnfolder]: 2/25 cut-off events. [2022-12-06 06:24:14,155 INFO L131 PetriNetUnfolder]: For 17/18 co-relation queries the response was YES. [2022-12-06 06:24:14,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 25 events. 2/25 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 60. Up to 9 conditions per place. [2022-12-06 06:24:14,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 20 transitions, 97 flow [2022-12-06 06:24:14,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-06 06:24:14,553 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:24:14,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 407 [2022-12-06 06:24:14,554 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 85 flow [2022-12-06 06:24:14,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:14,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:14,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:14,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:24:14,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:24:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2106435815, now seen corresponding path program 1 times [2022-12-06 06:24:14,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:14,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827310057] [2022-12-06 06:24:14,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:14,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:15,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:15,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827310057] [2022-12-06 06:24:15,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827310057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:15,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:15,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:24:15,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814600036] [2022-12-06 06:24:15,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:15,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:24:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:15,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:24:15,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:24:15,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:24:15,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 85 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:15,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:15,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:24:15,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:15,367 INFO L130 PetriNetUnfolder]: 25/68 cut-off events. [2022-12-06 06:24:15,367 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 06:24:15,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 68 events. 25/68 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 212. Up to 24 conditions per place. [2022-12-06 06:24:15,368 INFO L137 encePairwiseOnDemand]: 6/13 looper letters, 20 selfloop transitions, 8 changer transitions 9/37 dead transitions. [2022-12-06 06:24:15,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 243 flow [2022-12-06 06:24:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:24:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:24:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-12-06 06:24:15,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2022-12-06 06:24:15,369 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 85 flow. Second operand 8 states and 34 transitions. [2022-12-06 06:24:15,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 243 flow [2022-12-06 06:24:15,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 210 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-06 06:24:15,371 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 92 flow [2022-12-06 06:24:15,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-12-06 06:24:15,372 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2022-12-06 06:24:15,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:15,372 INFO L89 Accepts]: Start accepts. Operand has 32 places, 19 transitions, 92 flow [2022-12-06 06:24:15,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:15,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:15,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 92 flow [2022-12-06 06:24:15,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 92 flow [2022-12-06 06:24:15,377 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2022-12-06 06:24:15,377 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2022-12-06 06:24:15,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 23 events. 3/23 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 51. Up to 6 conditions per place. [2022-12-06 06:24:15,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 19 transitions, 92 flow [2022-12-06 06:24:15,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 06:24:16,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] $Ultimate##0-->L793: Formula: (let ((.cse3 (= (mod v_~z$r_buff1_thd2~0_218 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd2~0_213 256) 0))) (let ((.cse9 (not .cse7)) (.cse8 (and .cse3 .cse7)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_364 256) 0) .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_412 256) 0))) (let ((.cse1 (= (mod v_~z$w_buff1_used~0_363 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_83 256) 0))) (.cse4 (= (mod v_~z$w_buff0_used~0_411 256) 0)) (.cse5 (or .cse8 .cse10 .cse11)) (.cse6 (and .cse9 (not .cse11)))) (and (= v_~z$mem_tmp~0_73 v_~z~0_319) (= v_~y~0_44 v_~__unbuffered_p1_EAX~0_83) (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= v_~z$w_buff1~0_217 v_~z$w_buff1~0_216) (= v_~z$r_buff1_thd2~0_217 (ite .cse0 v_~z$r_buff1_thd2~0_218 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd2~0_212 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~z$r_buff1_thd2~0_218 0))) (= (ite .cse0 v_~z$w_buff0_used~0_412 (ite .cse5 v_~z$w_buff0_used~0_412 (ite .cse6 0 v_~z$w_buff0_used~0_412))) v_~z$w_buff0_used~0_411) (= v_~z$r_buff0_thd2~0_212 (ite .cse0 v_~z$r_buff0_thd2~0_213 (ite (or (and .cse1 .cse7) .cse8 .cse4) v_~z$r_buff0_thd2~0_213 (ite (and .cse9 (not .cse4)) 0 v_~z$r_buff0_thd2~0_213)))) (= v_~z$flush_delayed~0_84 0) (= v_~y~0_44 1) (= v_~z$w_buff0~0_261 v_~z$w_buff0~0_260) (= v_~weak$$choice0~0_54 |v_P1Thread1of1ForFork1_#t~nondet3_80|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23) (= v_~z~0_318 (ite .cse0 v_~z$mem_tmp~0_73 v_~__unbuffered_p1_EBX~0_104)) (= v_~z$w_buff1_used~0_363 (ite .cse0 v_~z$w_buff1_used~0_364 (ite (or .cse8 .cse10 .cse4) v_~z$w_buff1_used~0_364 0))) (= (ite .cse5 v_~z~0_319 (ite .cse6 v_~z$w_buff0~0_261 v_~z$w_buff1~0_217)) v_~__unbuffered_p1_EBX~0_104) (= v_~x~0_40 1) (= v_~weak$$choice2~0_83 |v_P1Thread1of1ForFork1_#t~nondet4_80|))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_412, ~z$w_buff0~0=v_~z$w_buff0~0_261, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_218, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_80|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_364, ~z$w_buff1~0=v_~z$w_buff1~0_217, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~z~0=v_~z~0_319, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_73, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_104, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_411, ~z$w_buff0~0=v_~z$w_buff0~0_260, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_217, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_363, ~z$w_buff1~0=v_~z$w_buff1~0_216, ~z$flush_delayed~0=v_~z$flush_delayed~0_84, ~weak$$choice0~0=v_~weak$$choice0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_83, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~z~0=v_~z~0_318, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_212, ~x~0=v_~x~0_40} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet4, ~z$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~nondet3, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~z~0, ~weak$$choice2~0, ~y~0, ~z$r_buff0_thd2~0, ~x~0] and [287] L754-->L761: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_105 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_27 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_106 256) 0)))) (.cse3 (and (not (= (mod v_~z$w_buff1_used~0_99 256) 0)) .cse0)) (.cse4 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_98 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_26 256) 0)))) 0 v_~z$r_buff1_thd1~0_18) v_~z$r_buff1_thd1~0_17) (= v_~z$w_buff0_used~0_105 (ite .cse2 0 v_~z$w_buff0_used~0_106)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_99) v_~z$w_buff1_used~0_98) (= v_~z~0_74 (ite .cse2 v_~z$w_buff0~0_54 (ite .cse3 v_~z$w_buff1~0_43 v_~z~0_75))) (= v_~z$r_buff0_thd1~0_26 (ite .cse4 0 v_~z$r_buff0_thd1~0_27))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_54, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_99, ~z$w_buff1~0=v_~z$w_buff1~0_43, ~z~0=v_~z~0_75, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_54, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_98, ~z$w_buff1~0=v_~z$w_buff1~0_43, ~z~0=v_~z~0_74, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-06 06:24:18,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] $Ultimate##0-->L751: Formula: (and (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_176 256) 0)) (not (= (mod v_~z$w_buff0_used~0_196 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~z$w_buff0_used~0_197 v_~z$w_buff1_used~0_176) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~z$w_buff0~0_116 1) (= v_~z$w_buff0~0_117 v_~z$w_buff1~0_94) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (= v_~z$w_buff0_used~0_196 1) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_80) (= v_~z$r_buff0_thd1~0_56 1) (= v_~z$r_buff0_thd1~0_57 v_~z$r_buff1_thd1~0_39) (= v_~z$r_buff0_thd2~0_105 v_~z$r_buff1_thd2~0_105)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_197, ~z$w_buff0~0=v_~z$w_buff0~0_117, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_105} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_196, ~z$w_buff0~0=v_~z$w_buff0~0_116, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_105, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_176, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_80, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_56, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_105} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0_~arg#1.base, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg#1.offset, ~z$r_buff0_thd1~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [394] $Ultimate##0-->L761: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd2~0_229 256) 0)) (.cse12 (= (mod v_~z$r_buff0_thd2~0_224 256) 0))) (let ((.cse13 (not .cse12)) (.cse20 (= (mod v_~z$w_buff0_used~0_426 256) 0)) (.cse19 (and .cse12 (= (mod v_~z$w_buff1_used~0_377 256) 0))) (.cse11 (and .cse12 .cse6))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_85 256) 0))) (.cse9 (or .cse20 .cse19 .cse11)) (.cse10 (and .cse13 (not .cse20)))) (let ((.cse1 (ite .cse2 v_~z$w_buff0_used~0_426 (ite .cse9 v_~z$w_buff0_used~0_426 (ite .cse10 0 v_~z$w_buff0_used~0_426))))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse15 (ite .cse2 v_~z$w_buff1_used~0_377 (ite (or .cse3 .cse19 .cse11) v_~z$w_buff1_used~0_377 0)))) (let ((.cse16 (not (= (mod v_~z$w_buff0_used~0_424 256) 0))) (.cse17 (not (= (mod v_~z$r_buff1_thd1~0_117 256) 0))) (.cse4 (= (mod .cse15 256) 0)) (.cse14 (not .cse3)) (.cse18 (not (= (mod v_~z$r_buff0_thd1~0_174 256) 0)))) (let ((.cse0 (and .cse14 .cse18)) (.cse7 (and .cse17 (not .cse4))) (.cse8 (and .cse16 .cse18))) (and (= v_~z$w_buff0~0_269 v_~z$w_buff0~0_268) (= v_~y~0_46 v_~__unbuffered_p1_EAX~0_85) (= |v_P1Thread1of1ForFork1_#in~arg.offset_25| v_P1Thread1of1ForFork1_~arg.offset_25) (= v_~z$w_buff0_used~0_424 (ite .cse0 0 .cse1)) (= v_~y~0_46 1) (= v_~weak$$choice0~0_56 |v_P1Thread1of1ForFork1_#t~nondet3_84|) (= v_~x~0_42 1) (= v_~z$r_buff1_thd2~0_228 (ite .cse2 v_~z$r_buff1_thd2~0_229 (ite (let ((.cse5 (= (mod v_~z$r_buff0_thd2~0_223 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse6 .cse5))) v_~z$r_buff1_thd2~0_229 0))) (= v_~z~0_330 (ite .cse0 v_~z$w_buff0~0_268 (ite .cse7 v_~z$w_buff1~0_223 (ite .cse2 v_~z$mem_tmp~0_75 v_~__unbuffered_p1_EBX~0_106)))) (= v_~z$flush_delayed~0_86 0) (= v_~z$w_buff1~0_224 v_~z$w_buff1~0_223) (= (ite .cse8 0 v_~z$r_buff0_thd1~0_174) v_~z$r_buff0_thd1~0_173) (= v_~z$mem_tmp~0_75 v_~z~0_332) (= (ite .cse9 v_~z~0_332 (ite .cse10 v_~z$w_buff0~0_269 v_~z$w_buff1~0_224)) v_~__unbuffered_p1_EBX~0_106) (= v_~weak$$choice2~0_85 |v_P1Thread1of1ForFork1_#t~nondet4_84|) (= v_~z$r_buff0_thd2~0_223 (ite .cse2 v_~z$r_buff0_thd2~0_224 (ite (or .cse3 .cse11 (and .cse4 .cse12)) v_~z$r_buff0_thd2~0_224 (ite (and .cse13 .cse14) 0 v_~z$r_buff0_thd2~0_224)))) (= (ite (or .cse7 .cse8) 0 .cse15) v_~z$w_buff1_used~0_375) (= v_P1Thread1of1ForFork1_~arg.base_25 |v_P1Thread1of1ForFork1_#in~arg.base_25|) (= v_~z$r_buff1_thd1~0_116 (ite (or (and .cse16 (not (= (mod v_~z$r_buff0_thd1~0_173 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_375 256) 0)) .cse17)) 0 v_~z$r_buff1_thd1~0_117))))))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_426, ~z$w_buff0~0=v_~z$w_buff0~0_269, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_84|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_229, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_84|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_377, ~z$w_buff1~0=v_~z$w_buff1~0_224, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_117, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~z~0=v_~z~0_332, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_224} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_75, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_106, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_424, ~z$w_buff0~0=v_~z$w_buff0~0_268, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_25, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_228, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_375, ~z$w_buff1~0=v_~z$w_buff1~0_223, ~z$flush_delayed~0=v_~z$flush_delayed~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_56, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_85, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_116, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~z~0=v_~z~0_330, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_223, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet4, ~z$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~nondet3, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd1~0, ~z~0, ~z$r_buff0_thd1~0, ~weak$$choice2~0, ~y~0, ~z$r_buff0_thd2~0, ~x~0] [2022-12-06 06:24:18,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L761: Formula: (let ((.cse10 (= (mod v_~z$w_buff0_used~0_456 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd2~0_249 256) 0))) (let ((.cse14 (and .cse10 .cse6))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_90 256) 0))) (.cse11 (or .cse14 .cse6)) (.cse9 (not .cse6))) (let ((.cse13 (ite .cse2 1 (ite .cse11 1 (ite .cse9 0 1))))) (let ((.cse3 (= (mod .cse13 256) 0))) (let ((.cse8 (ite .cse2 v_~z$w_buff0_used~0_456 (ite (or .cse3 .cse14 .cse6) v_~z$w_buff0_used~0_456 0)))) (let ((.cse12 (not (= (mod v_~z$r_buff0_thd1~0_197 256) 0))) (.cse5 (= (mod .cse8 256) 0))) (let ((.cse1 (and .cse12 (not .cse5))) (.cse0 (not .cse3)) (.cse7 (not (= (mod v_~z$w_buff0_used~0_454 256) 0)))) (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_27| v_P1Thread1of1ForFork1_~arg.offset_27) (= v_~z~0_354 (ite .cse0 v_~z$w_buff0~0_292 (ite .cse1 v_~z$w_buff1~0_243 (ite .cse2 v_~z$mem_tmp~0_80 v_~__unbuffered_p1_EBX~0_111)))) (= v_~z$r_buff1_thd2~0_252 (ite .cse2 v_~z$r_buff0_thd2~0_249 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd2~0_248 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff0_thd2~0_249 0))) (= v_~z$w_buff0~0_294 v_~z$w_buff1~0_243) (= v_~z$w_buff1_used~0_401 (ite (or .cse7 .cse1) 0 .cse8)) (= v_~z$r_buff0_thd0~0_192 v_~z$r_buff1_thd0~0_196) (= v_~z$r_buff0_thd2~0_248 (ite .cse2 v_~z$r_buff0_thd2~0_249 (ite (or .cse3 (and .cse5 .cse6) .cse6) v_~z$r_buff0_thd2~0_249 (ite (and .cse9 .cse0) 0 v_~z$r_buff0_thd2~0_249)))) (= (ite .cse10 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|) (= v_~weak$$choice2~0_90 |v_P1Thread1of1ForFork1_#t~nondet4_94|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|) (= (ite .cse11 v_~z~0_355 (ite .cse9 1 v_~z$w_buff0~0_294)) v_~__unbuffered_p1_EBX~0_111) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61| 0)) (= v_~weak$$choice0~0_61 |v_P1Thread1of1ForFork1_#t~nondet3_94|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_57| |v_P0Thread1of1ForFork0_~arg#1.offset_57|) (= v_P1Thread1of1ForFork1_~arg.base_27 |v_P1Thread1of1ForFork1_#in~arg.base_27|) (= v_~z$r_buff1_thd1~0_129 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_401 256) 0)) .cse12) (and (not (= (mod v_~z$r_buff0_thd1~0_195 256) 0)) .cse7)) 0 v_~z$r_buff0_thd1~0_197)) (= v_~z$w_buff0~0_292 1) (= v_~z$mem_tmp~0_80 v_~z~0_355) (= v_~y~0_48 v_~__unbuffered_p1_EAX~0_87) (= |v_P0Thread1of1ForFork0_~arg#1.base_57| |v_P0Thread1of1ForFork0_#in~arg#1.base_57|) (= v_~z$w_buff0_used~0_454 (ite .cse0 0 .cse13)) (= v_~x~0_44 1) (= v_~z$flush_delayed~0_91 0) (= v_~y~0_48 1) (= (ite .cse7 0 1) v_~z$r_buff0_thd1~0_195)))))))))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_456, ~z$w_buff0~0=v_~z$w_buff0~0_294, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_94|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_94|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_57|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_192, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_27|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_27|, ~z~0=v_~z~0_355, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_197, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_249} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_252, ~z$w_buff1~0=v_~z$w_buff1~0_243, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_57|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_57|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_192, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_27|, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_248, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61|, ~z$mem_tmp~0=v_~z$mem_tmp~0_80, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_111, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_454, ~z$w_buff0~0=v_~z$w_buff0~0_292, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_401, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_57|, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~weak$$choice0~0=v_~weak$$choice0~0_61, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_27, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_129, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_27|, ~z~0=v_~z~0_354, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_195, ~weak$$choice2~0=v_~weak$$choice2~0_90, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y~0, ~z$r_buff0_thd2~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~z$w_buff1_used~0, P0Thread1of1ForFork0_~arg#1.base, ~z$flush_delayed~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~z$r_buff1_thd1~0, ~z~0, ~z$r_buff0_thd1~0, ~weak$$choice2~0, ~x~0] and [286] L751-->L754: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 06:24:19,364 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:24:19,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3993 [2022-12-06 06:24:19,365 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 93 flow [2022-12-06 06:24:19,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:19,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:19,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:19,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:24:19,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:24:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash 805906377, now seen corresponding path program 1 times [2022-12-06 06:24:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:19,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327833800] [2022-12-06 06:24:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:19,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:24:19,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:24:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:24:19,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:24:19,475 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:24:19,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:24:19,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:24:19,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:24:19,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:24:19,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:24:19,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:24:19,478 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:19,483 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:24:19,483 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:24:19,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:24:19 BasicIcfg [2022-12-06 06:24:19,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:24:19,549 INFO L158 Benchmark]: Toolchain (without parser) took 12778.04ms. Allocated memory was 185.6MB in the beginning and 475.0MB in the end (delta: 289.4MB). Free memory was 160.7MB in the beginning and 219.4MB in the end (delta: -58.7MB). Peak memory consumption was 231.7MB. Max. memory is 8.0GB. [2022-12-06 06:24:19,549 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory was 163.4MB in the beginning and 163.3MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:24:19,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.26ms. Allocated memory is still 185.6MB. Free memory was 160.7MB in the beginning and 135.1MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 06:24:19,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.40ms. Allocated memory is still 185.6MB. Free memory was 135.1MB in the beginning and 132.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:24:19,550 INFO L158 Benchmark]: Boogie Preprocessor took 35.45ms. Allocated memory is still 185.6MB. Free memory was 132.9MB in the beginning and 130.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:24:19,550 INFO L158 Benchmark]: RCFGBuilder took 747.09ms. Allocated memory was 185.6MB in the beginning and 248.5MB in the end (delta: 62.9MB). Free memory was 130.9MB in the beginning and 220.7MB in the end (delta: -89.8MB). Peak memory consumption was 32.3MB. Max. memory is 8.0GB. [2022-12-06 06:24:19,550 INFO L158 Benchmark]: TraceAbstraction took 11379.97ms. Allocated memory was 248.5MB in the beginning and 475.0MB in the end (delta: 226.5MB). Free memory was 220.2MB in the beginning and 219.4MB in the end (delta: 781.8kB). Peak memory consumption was 227.8MB. Max. memory is 8.0GB. [2022-12-06 06:24:19,554 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory was 163.4MB in the beginning and 163.3MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 557.26ms. Allocated memory is still 185.6MB. Free memory was 160.7MB in the beginning and 135.1MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.40ms. Allocated memory is still 185.6MB. Free memory was 135.1MB in the beginning and 132.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.45ms. Allocated memory is still 185.6MB. Free memory was 132.9MB in the beginning and 130.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 747.09ms. Allocated memory was 185.6MB in the beginning and 248.5MB in the end (delta: 62.9MB). Free memory was 130.9MB in the beginning and 220.7MB in the end (delta: -89.8MB). Peak memory consumption was 32.3MB. Max. memory is 8.0GB. * TraceAbstraction took 11379.97ms. Allocated memory was 248.5MB in the beginning and 475.0MB in the end (delta: 226.5MB). Free memory was 220.2MB in the beginning and 219.4MB in the end (delta: 781.8kB). Peak memory consumption was 227.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 95 PlacesBefore, 28 PlacesAfterwards, 90 TransitionsBefore, 22 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 945, independent: 898, independent conditional: 898, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 945, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 945, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 945, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 749, independent: 717, independent conditional: 0, independent unconditional: 717, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 749, independent: 709, independent conditional: 0, independent unconditional: 709, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 258, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 945, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 749, unknown conditional: 0, unknown unconditional: 749] , Statistics on independence cache: Total cache size (in pairs): 1118, Positive cache size: 1086, Positive conditional cache size: 0, Positive unconditional cache size: 1086, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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, 23 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 64, independent conditional: 18, independent unconditional: 46, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 64, independent conditional: 18, independent unconditional: 46, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 64, independent conditional: 18, independent unconditional: 46, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 39, independent conditional: 10, independent unconditional: 29, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 82, dependent conditional: 40, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, independent: 25, independent conditional: 8, independent unconditional: 17, dependent: 17, dependent conditional: 8, dependent unconditional: 9, unknown: 55, unknown conditional: 16, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 41, Positive conditional cache size: 12, Positive unconditional cache size: 29, Negative cache size: 16, Negative conditional cache size: 6, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 2, independent unconditional: 31, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 51, Positive conditional cache size: 12, Positive unconditional cache size: 39, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 62, independent: 35, independent conditional: 21, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 58, Positive conditional cache size: 16, Positive unconditional cache size: 42, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, 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, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 63, Positive conditional cache size: 16, Positive unconditional cache size: 47, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 33 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 17 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 42, independent conditional: 10, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 42, independent conditional: 6, independent unconditional: 36, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 42, independent conditional: 6, independent unconditional: 36, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 64, independent: 39, independent conditional: 3, independent unconditional: 36, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 68, Positive conditional cache size: 19, Positive unconditional cache size: 49, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 31 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 78, Positive conditional cache size: 24, Positive unconditional cache size: 54, Negative cache size: 30, Negative conditional cache size: 10, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L817] 0 pthread_t t897; [L818] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t897, ((void *)0), P0, ((void *)0))=-1, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 pthread_t t898; [L820] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t898, ((void *)0), P1, ((void *)0))=0, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L746] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L746] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 1 [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L835] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 820]: 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 5 procedures, 112 locations, 5 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: 11.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 3 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=5, InterpolantAutomatonStates: 28, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:24:19,588 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...