/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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:04:56,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:04:56,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:04:56,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:04:56,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:04:56,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:04:56,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:04:56,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:04:56,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:04:56,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:04:56,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:04:56,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:04:56,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:04:56,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:04:56,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:04:56,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:04:56,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:04:56,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:04:56,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:04:57,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:04:57,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:04:57,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:04:57,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:04:57,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:04:57,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:04:57,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:04:57,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:04:57,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:04:57,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:04:57,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:04:57,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:04:57,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:04:57,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:04:57,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:04:57,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:04:57,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:04:57,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:04:57,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:04:57,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:04:57,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:04:57,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:04:57,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:04:57,053 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:04:57,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:04:57,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:04:57,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:04:57,055 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:04:57,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:04:57,055 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:04:57,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:04:57,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:04:57,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:04:57,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:04:57,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:04:57,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:04:57,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:04:57,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:04:57,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:04:57,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:04:57,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:04:57,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:04:57,058 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:04:57,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 12:04:57,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:04:57,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:04:57,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:04:57,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:04:57,403 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:04:57,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:04:58,486 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:04:58,820 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:04:58,821 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:04:58,839 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31efd8b1a/a6cd8ad76695415d9292528fe0144008/FLAGe0b8b9394 [2022-12-13 12:04:58,856 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31efd8b1a/a6cd8ad76695415d9292528fe0144008 [2022-12-13 12:04:58,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:04:58,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:04:58,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:04:58,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:04:58,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:04:58,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:04:58" (1/1) ... [2022-12-13 12:04:58,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae3a723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:58, skipping insertion in model container [2022-12-13 12:04:58,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:04:58" (1/1) ... [2022-12-13 12:04:58,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:04:58,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:04:59,061 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 12:04:59,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:04:59,248 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:04:59,258 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 12:04:59,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:59,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:59,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:04:59,360 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:04:59,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59 WrapperNode [2022-12-13 12:04:59,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:04:59,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:04:59,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:04:59,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:04:59,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,412 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-13 12:04:59,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:04:59,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:04:59,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:04:59,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:04:59,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,460 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:04:59,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:04:59,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:04:59,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:04:59,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (1/1) ... [2022-12-13 12:04:59,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:04:59,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:04:59,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:04:59,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:04:59,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:04:59,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:04:59,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:04:59,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:04:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:04:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:04:59,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:04:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:04:59,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:04:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:04:59,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:04:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:04:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:04:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:04:59,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:04:59,642 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:04:59,759 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:04:59,760 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:05:00,105 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:05:00,231 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:05:00,232 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:05:00,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:05:00 BoogieIcfgContainer [2022-12-13 12:05:00,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:05:00,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:05:00,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:05:00,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:05:00,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:04:58" (1/3) ... [2022-12-13 12:05:00,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de15463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:05:00, skipping insertion in model container [2022-12-13 12:05:00,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:59" (2/3) ... [2022-12-13 12:05:00,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de15463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:05:00, skipping insertion in model container [2022-12-13 12:05:00,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:05:00" (3/3) ... [2022-12-13 12:05:00,239 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:05:00,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:05:00,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:05:00,251 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:05:00,300 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:05:00,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 12:05:00,379 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 12:05:00,379 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:00,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:05:00,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 12:05:00,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-13 12:05:00,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:00,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 12:05:00,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-13 12:05:00,437 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 12:05:00,437 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:00,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:05:00,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 12:05:00,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 1818 [2022-12-13 12:05:04,225 INFO L241 LiptonReduction]: Total number of compositions: 82 [2022-12-13 12:05:04,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:05:04,269 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;@6bb214fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:05:04,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 12:05:04,273 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-13 12:05:04,273 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:04,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:04,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:05:04,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash 473315, now seen corresponding path program 1 times [2022-12-13 12:05:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:04,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134613440] [2022-12-13 12:05:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:04,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134613440] [2022-12-13 12:05:04,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134613440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:04,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:04,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:05:04,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946497235] [2022-12-13 12:05:04,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:04,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:05:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:04,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:05:04,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:05:04,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2022-12-13 12:05:04,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:04,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:04,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2022-12-13 12:05:04,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:06,044 INFO L130 PetriNetUnfolder]: 8875/14288 cut-off events. [2022-12-13 12:05:06,044 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 12:05:06,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27011 conditions, 14288 events. 8875/14288 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 105111 event pairs, 1171 based on Foata normal form. 0/9212 useless extension candidates. Maximal degree in co-relation 27000. Up to 10729 conditions per place. [2022-12-13 12:05:06,136 INFO L137 encePairwiseOnDemand]: 60/65 looper letters, 36 selfloop transitions, 2 changer transitions 58/106 dead transitions. [2022-12-13 12:05:06,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 415 flow [2022-12-13 12:05:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-12-13 12:05:06,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 12:05:06,149 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 139 flow. Second operand 3 states and 135 transitions. [2022-12-13 12:05:06,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 415 flow [2022-12-13 12:05:06,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 106 transitions, 410 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:05:06,154 INFO L231 Difference]: Finished difference. Result has 71 places, 32 transitions, 74 flow [2022-12-13 12:05:06,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=71, PETRI_TRANSITIONS=32} [2022-12-13 12:05:06,158 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2022-12-13 12:05:06,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:06,159 INFO L89 Accepts]: Start accepts. Operand has 71 places, 32 transitions, 74 flow [2022-12-13 12:05:06,162 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:06,162 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:06,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 32 transitions, 74 flow [2022-12-13 12:05:06,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 12:05:06,174 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 12:05:06,175 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:06,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 76 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 12:05:06,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 12:05:06,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-13 12:05:06,290 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:06,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 12:05:06,293 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 12:05:06,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:06,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:06,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:06,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:05:06,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2064129077, now seen corresponding path program 1 times [2022-12-13 12:05:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:06,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605146488] [2022-12-13 12:05:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:06,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605146488] [2022-12-13 12:05:06,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605146488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:06,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:06,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:05:06,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381271782] [2022-12-13 12:05:06,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:06,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:05:06,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:05:06,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:05:06,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 12:05:06,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:06,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:06,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 12:05:06,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:06,846 INFO L130 PetriNetUnfolder]: 3323/5179 cut-off events. [2022-12-13 12:05:06,846 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-13 12:05:06,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10352 conditions, 5179 events. 3323/5179 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 29721 event pairs, 1027 based on Foata normal form. 0/4121 useless extension candidates. Maximal degree in co-relation 10342. Up to 3143 conditions per place. [2022-12-13 12:05:06,866 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 36 selfloop transitions, 5 changer transitions 2/51 dead transitions. [2022-12-13 12:05:06,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 202 flow [2022-12-13 12:05:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 12:05:06,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 12:05:06,867 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 68 transitions. [2022-12-13 12:05:06,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 202 flow [2022-12-13 12:05:06,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:05:06,868 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 106 flow [2022-12-13 12:05:06,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 12:05:06,869 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -31 predicate places. [2022-12-13 12:05:06,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:06,869 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 106 flow [2022-12-13 12:05:06,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:06,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:06,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 106 flow [2022-12-13 12:05:06,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 106 flow [2022-12-13 12:05:06,881 INFO L130 PetriNetUnfolder]: 24/161 cut-off events. [2022-12-13 12:05:06,881 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 12:05:06,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 161 events. 24/161 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 914 event pairs, 10 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 242. Up to 45 conditions per place. [2022-12-13 12:05:06,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 106 flow [2022-12-13 12:05:06,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-13 12:05:06,912 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:06,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 12:05:06,913 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 106 flow [2022-12-13 12:05:06,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:06,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:06,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:06,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:05:06,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 436506573, now seen corresponding path program 1 times [2022-12-13 12:05:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:06,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538642120] [2022-12-13 12:05:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:07,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:07,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538642120] [2022-12-13 12:05:07,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538642120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:07,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:07,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513948976] [2022-12-13 12:05:07,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:07,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:07,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:07,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:07,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 12:05:07,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:07,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:07,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 12:05:07,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:07,591 INFO L130 PetriNetUnfolder]: 2518/4009 cut-off events. [2022-12-13 12:05:07,591 INFO L131 PetriNetUnfolder]: For 1113/1113 co-relation queries the response was YES. [2022-12-13 12:05:07,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9103 conditions, 4009 events. 2518/4009 cut-off events. For 1113/1113 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 22039 event pairs, 450 based on Foata normal form. 24/3336 useless extension candidates. Maximal degree in co-relation 9091. Up to 2109 conditions per place. [2022-12-13 12:05:07,611 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 43 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2022-12-13 12:05:07,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 256 flow [2022-12-13 12:05:07,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 12:05:07,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-13 12:05:07,613 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 106 flow. Second operand 4 states and 80 transitions. [2022-12-13 12:05:07,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 256 flow [2022-12-13 12:05:07,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:05:07,617 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 134 flow [2022-12-13 12:05:07,618 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-13 12:05:07,618 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -28 predicate places. [2022-12-13 12:05:07,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:07,619 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 134 flow [2022-12-13 12:05:07,619 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:07,619 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:07,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 134 flow [2022-12-13 12:05:07,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 134 flow [2022-12-13 12:05:07,632 INFO L130 PetriNetUnfolder]: 21/143 cut-off events. [2022-12-13 12:05:07,633 INFO L131 PetriNetUnfolder]: For 41/47 co-relation queries the response was YES. [2022-12-13 12:05:07,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 143 events. 21/143 cut-off events. For 41/47 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 772 event pairs, 4 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 247. Up to 40 conditions per place. [2022-12-13 12:05:07,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 134 flow [2022-12-13 12:05:07,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-13 12:05:07,668 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:07,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 12:05:07,669 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 134 flow [2022-12-13 12:05:07,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:07,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:07,670 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:07,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:05:07,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash 436509239, now seen corresponding path program 1 times [2022-12-13 12:05:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:07,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812890264] [2022-12-13 12:05:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:07,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812890264] [2022-12-13 12:05:07,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812890264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:07,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:07,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:05:07,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777698455] [2022-12-13 12:05:07,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:07,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:05:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:07,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:05:07,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:05:07,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 12:05:07,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:07,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:07,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 12:05:07,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:08,184 INFO L130 PetriNetUnfolder]: 2459/3917 cut-off events. [2022-12-13 12:05:08,185 INFO L131 PetriNetUnfolder]: For 2260/2260 co-relation queries the response was YES. [2022-12-13 12:05:08,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9426 conditions, 3917 events. 2459/3917 cut-off events. For 2260/2260 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21891 event pairs, 1365 based on Foata normal form. 10/3241 useless extension candidates. Maximal degree in co-relation 9411. Up to 3587 conditions per place. [2022-12-13 12:05:08,212 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 39 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2022-12-13 12:05:08,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 276 flow [2022-12-13 12:05:08,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 12:05:08,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:05:08,215 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 134 flow. Second operand 3 states and 62 transitions. [2022-12-13 12:05:08,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 276 flow [2022-12-13 12:05:08,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:05:08,221 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 172 flow [2022-12-13 12:05:08,221 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 12:05:08,222 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -26 predicate places. [2022-12-13 12:05:08,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:08,222 INFO L89 Accepts]: Start accepts. Operand has 48 places, 40 transitions, 172 flow [2022-12-13 12:05:08,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:08,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:08,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 172 flow [2022-12-13 12:05:08,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 172 flow [2022-12-13 12:05:08,235 INFO L130 PetriNetUnfolder]: 15/121 cut-off events. [2022-12-13 12:05:08,236 INFO L131 PetriNetUnfolder]: For 62/75 co-relation queries the response was YES. [2022-12-13 12:05:08,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 121 events. 15/121 cut-off events. For 62/75 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 607 event pairs, 3 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 230. Up to 32 conditions per place. [2022-12-13 12:05:08,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 172 flow [2022-12-13 12:05:08,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-13 12:05:08,265 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:08,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 12:05:08,269 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 172 flow [2022-12-13 12:05:08,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:08,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:08,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:08,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:05:08,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash 646803061, now seen corresponding path program 1 times [2022-12-13 12:05:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:08,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134030894] [2022-12-13 12:05:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:08,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:08,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134030894] [2022-12-13 12:05:08,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134030894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:08,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:08,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494046965] [2022-12-13 12:05:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:08,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:05:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:05:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:05:08,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 12:05:08,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:08,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:08,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 12:05:08,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:08,852 INFO L130 PetriNetUnfolder]: 3185/4937 cut-off events. [2022-12-13 12:05:08,852 INFO L131 PetriNetUnfolder]: For 3164/3249 co-relation queries the response was YES. [2022-12-13 12:05:08,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12239 conditions, 4937 events. 3185/4937 cut-off events. For 3164/3249 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27527 event pairs, 871 based on Foata normal form. 91/3529 useless extension candidates. Maximal degree in co-relation 12222. Up to 4684 conditions per place. [2022-12-13 12:05:08,885 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 46 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2022-12-13 12:05:08,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 377 flow [2022-12-13 12:05:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 12:05:08,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2022-12-13 12:05:08,900 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 172 flow. Second operand 3 states and 64 transitions. [2022-12-13 12:05:08,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 377 flow [2022-12-13 12:05:08,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 369 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 12:05:08,904 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 233 flow [2022-12-13 12:05:08,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-13 12:05:08,905 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -24 predicate places. [2022-12-13 12:05:08,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:08,905 INFO L89 Accepts]: Start accepts. Operand has 50 places, 49 transitions, 233 flow [2022-12-13 12:05:08,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:08,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:08,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 49 transitions, 233 flow [2022-12-13 12:05:08,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 233 flow [2022-12-13 12:05:09,030 INFO L130 PetriNetUnfolder]: 708/1468 cut-off events. [2022-12-13 12:05:09,030 INFO L131 PetriNetUnfolder]: For 472/546 co-relation queries the response was YES. [2022-12-13 12:05:09,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3137 conditions, 1468 events. 708/1468 cut-off events. For 472/546 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 11394 event pairs, 363 based on Foata normal form. 3/799 useless extension candidates. Maximal degree in co-relation 3121. Up to 1072 conditions per place. [2022-12-13 12:05:09,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 49 transitions, 233 flow [2022-12-13 12:05:09,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 816 [2022-12-13 12:05:09,070 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:09,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 12:05:09,072 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 233 flow [2022-12-13 12:05:09,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:09,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:09,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:09,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:05:09,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1676971004, now seen corresponding path program 1 times [2022-12-13 12:05:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:09,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781988255] [2022-12-13 12:05:09,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781988255] [2022-12-13 12:05:09,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781988255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:09,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:09,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:05:09,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975000075] [2022-12-13 12:05:09,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:09,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:09,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:09,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:09,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 12:05:09,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:09,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:09,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 12:05:09,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:09,756 INFO L130 PetriNetUnfolder]: 1613/2849 cut-off events. [2022-12-13 12:05:09,757 INFO L131 PetriNetUnfolder]: For 1807/1844 co-relation queries the response was YES. [2022-12-13 12:05:09,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8797 conditions, 2849 events. 1613/2849 cut-off events. For 1807/1844 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 17269 event pairs, 214 based on Foata normal form. 186/2190 useless extension candidates. Maximal degree in co-relation 8778. Up to 2026 conditions per place. [2022-12-13 12:05:09,775 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 58 selfloop transitions, 19 changer transitions 0/86 dead transitions. [2022-12-13 12:05:09,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 551 flow [2022-12-13 12:05:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 12:05:09,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2022-12-13 12:05:09,777 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 233 flow. Second operand 4 states and 88 transitions. [2022-12-13 12:05:09,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 551 flow [2022-12-13 12:05:09,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 541 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:05:09,782 INFO L231 Difference]: Finished difference. Result has 53 places, 58 transitions, 335 flow [2022-12-13 12:05:09,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=53, PETRI_TRANSITIONS=58} [2022-12-13 12:05:09,785 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2022-12-13 12:05:09,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:09,785 INFO L89 Accepts]: Start accepts. Operand has 53 places, 58 transitions, 335 flow [2022-12-13 12:05:09,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:09,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:09,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 58 transitions, 335 flow [2022-12-13 12:05:09,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 58 transitions, 335 flow [2022-12-13 12:05:09,859 INFO L130 PetriNetUnfolder]: 414/1057 cut-off events. [2022-12-13 12:05:09,859 INFO L131 PetriNetUnfolder]: For 406/753 co-relation queries the response was YES. [2022-12-13 12:05:09,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 1057 events. 414/1057 cut-off events. For 406/753 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 8425 event pairs, 90 based on Foata normal form. 8/627 useless extension candidates. Maximal degree in co-relation 3085. Up to 739 conditions per place. [2022-12-13 12:05:09,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 58 transitions, 335 flow [2022-12-13 12:05:09,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 818 [2022-12-13 12:05:09,892 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:09,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 12:05:09,893 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 58 transitions, 335 flow [2022-12-13 12:05:09,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:09,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:09,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:09,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:05:09,894 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:09,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 606944950, now seen corresponding path program 1 times [2022-12-13 12:05:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671359064] [2022-12-13 12:05:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:10,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:10,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671359064] [2022-12-13 12:05:10,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671359064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:10,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:10,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:05:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361057071] [2022-12-13 12:05:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:10,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:05:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:05:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:05:10,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 12:05:10,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:10,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:10,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 12:05:10,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:10,331 INFO L130 PetriNetUnfolder]: 920/1679 cut-off events. [2022-12-13 12:05:10,331 INFO L131 PetriNetUnfolder]: For 1265/1293 co-relation queries the response was YES. [2022-12-13 12:05:10,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6306 conditions, 1679 events. 920/1679 cut-off events. For 1265/1293 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9423 event pairs, 79 based on Foata normal form. 183/1305 useless extension candidates. Maximal degree in co-relation 6285. Up to 871 conditions per place. [2022-12-13 12:05:10,342 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 47 selfloop transitions, 28 changer transitions 2/86 dead transitions. [2022-12-13 12:05:10,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 617 flow [2022-12-13 12:05:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:05:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:05:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 12:05:10,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6064516129032258 [2022-12-13 12:05:10,344 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 335 flow. Second operand 5 states and 94 transitions. [2022-12-13 12:05:10,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 617 flow [2022-12-13 12:05:10,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 568 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 12:05:10,350 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 366 flow [2022-12-13 12:05:10,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2022-12-13 12:05:10,351 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2022-12-13 12:05:10,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:10,351 INFO L89 Accepts]: Start accepts. Operand has 55 places, 58 transitions, 366 flow [2022-12-13 12:05:10,353 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:10,353 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:10,353 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 58 transitions, 366 flow [2022-12-13 12:05:10,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 366 flow [2022-12-13 12:05:10,386 INFO L130 PetriNetUnfolder]: 207/562 cut-off events. [2022-12-13 12:05:10,386 INFO L131 PetriNetUnfolder]: For 362/598 co-relation queries the response was YES. [2022-12-13 12:05:10,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 562 events. 207/562 cut-off events. For 362/598 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 3941 event pairs, 0 based on Foata normal form. 1/278 useless extension candidates. Maximal degree in co-relation 1928. Up to 397 conditions per place. [2022-12-13 12:05:10,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 58 transitions, 366 flow [2022-12-13 12:05:10,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 12:05:10,892 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:05:10,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 542 [2022-12-13 12:05:10,893 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 362 flow [2022-12-13 12:05:10,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:10,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:10,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:10,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:05:10,893 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -498030534, now seen corresponding path program 1 times [2022-12-13 12:05:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:10,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618090779] [2022-12-13 12:05:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:10,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:11,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618090779] [2022-12-13 12:05:11,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618090779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:11,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:11,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:05:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682718544] [2022-12-13 12:05:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:11,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:05:11,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:11,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:05:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:05:11,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 12:05:11,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:11,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:11,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 12:05:11,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:11,882 INFO L130 PetriNetUnfolder]: 898/1642 cut-off events. [2022-12-13 12:05:11,882 INFO L131 PetriNetUnfolder]: For 2641/2745 co-relation queries the response was YES. [2022-12-13 12:05:11,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6447 conditions, 1642 events. 898/1642 cut-off events. For 2641/2745 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9895 event pairs, 32 based on Foata normal form. 87/1373 useless extension candidates. Maximal degree in co-relation 6426. Up to 781 conditions per place. [2022-12-13 12:05:11,890 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 61 selfloop transitions, 4 changer transitions 34/117 dead transitions. [2022-12-13 12:05:11,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 117 transitions, 940 flow [2022-12-13 12:05:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:05:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:05:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-13 12:05:11,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-13 12:05:11,892 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 362 flow. Second operand 6 states and 110 transitions. [2022-12-13 12:05:11,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 117 transitions, 940 flow [2022-12-13 12:05:11,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 117 transitions, 794 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 12:05:11,912 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 302 flow [2022-12-13 12:05:11,912 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2022-12-13 12:05:11,914 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2022-12-13 12:05:11,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:11,915 INFO L89 Accepts]: Start accepts. Operand has 56 places, 56 transitions, 302 flow [2022-12-13 12:05:11,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:11,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:11,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 302 flow [2022-12-13 12:05:11,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 302 flow [2022-12-13 12:05:11,939 INFO L130 PetriNetUnfolder]: 216/480 cut-off events. [2022-12-13 12:05:11,940 INFO L131 PetriNetUnfolder]: For 437/455 co-relation queries the response was YES. [2022-12-13 12:05:11,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 480 events. 216/480 cut-off events. For 437/455 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 2958 event pairs, 0 based on Foata normal form. 5/196 useless extension candidates. Maximal degree in co-relation 1360. Up to 226 conditions per place. [2022-12-13 12:05:11,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 302 flow [2022-12-13 12:05:11,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-13 12:05:12,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [466] L754-->L764: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_168 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_611 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_247 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_612 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_540 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_371 (ite .cse1 v_~y$w_buff1~0_303 v_~y~0_483)) v_~y~0_482) (= v_~y$w_buff0_used~0_611 (ite .cse0 0 v_~y$w_buff0_used~0_612)) (= v_~__unbuffered_cnt~0_519 (+ v_~__unbuffered_cnt~0_520 1)) (= v_~y$r_buff0_thd1~0_246 (ite .cse2 0 v_~y$r_buff0_thd1~0_247)) (= v_~y$r_buff1_thd1~0_167 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_539 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_246 256) 0)))) 0 v_~y$r_buff1_thd1~0_168)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_540) v_~y$w_buff1_used~0_539)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_168, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_612, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$w_buff0~0=v_~y$w_buff0~0_371, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_247, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_520, ~y~0=v_~y~0_483, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_167, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_611, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$w_buff0~0=v_~y$w_buff0~0_371, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_246, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_519, ~y~0=v_~y~0_482, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_539} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~__unbuffered_cnt~0, ~y~0, ~y$w_buff1_used~0] and [463] L833-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_191 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_549 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_190 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_550 256) 0)))) (.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_486 256) 0)) .cse3))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_125| 0) (= v_~y$w_buff0_used~0_549 (ite .cse0 0 v_~y$w_buff0_used~0_550)) (= v_~y$r_buff0_thd0~0_189 (ite .cse1 0 v_~y$r_buff0_thd0~0_190)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|) (= v_~y~0_430 (ite .cse0 v_~y$w_buff0~0_333 (ite .cse2 v_~y$w_buff1~0_273 v_~y~0_431))) (= v_~y$r_buff1_thd0~0_190 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_485 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_189 256) 0)))) 0 v_~y$r_buff1_thd0~0_191)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| (mod v_~main$tmp_guard1~0_130 256)) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_486) v_~y$w_buff1_used~0_485) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_125|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_122 0) (= 2 v_~__unbuffered_p2_EAX~0_85) (= 2 v_~x~0_103))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_130) (= v_~main$tmp_guard0~0_132 (ite (= (ite (= v_~__unbuffered_cnt~0_509 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_122, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_550, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_190, ~y$w_buff0~0=v_~y$w_buff0~0_333, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_509, ~y~0=v_~y~0_431, ~x~0=v_~x~0_103, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_191, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_486} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_125|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_122, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_111|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_549, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_129|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_130, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_189, ~y$w_buff0~0=v_~y$w_buff0~0_333, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_509, ~y~0=v_~y~0_430, ~x~0=v_~x~0_103, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_190, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:05:13,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] L754-->P0FINAL: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_172 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_251 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_615 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_544 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_616 256) 0))))) (and (= v_~y~0_486 (ite .cse0 v_~y$w_buff0~0_373 (ite .cse1 v_~y$w_buff1~0_305 v_~y~0_487))) (= v_~y$r_buff0_thd1~0_250 (ite .cse2 0 v_~y$r_buff0_thd1~0_251)) (= v_~y$r_buff1_thd1~0_171 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_543 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd1~0_250 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_172)) (= v_~y$w_buff1_used~0_543 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_544)) (= v_~__unbuffered_cnt~0_523 (+ v_~__unbuffered_cnt~0_524 1)) (= (ite .cse0 0 v_~y$w_buff0_used~0_616) v_~y$w_buff0_used~0_615) (= |v_P0Thread1of1ForFork2_#res#1.base_83| 0) (= |v_P0Thread1of1ForFork2_#res#1.offset_83| 0)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_172, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_616, ~y$w_buff1~0=v_~y$w_buff1~0_305, ~y$w_buff0~0=v_~y$w_buff0~0_373, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_251, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_524, ~y~0=v_~y~0_487, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_544} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_171, P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_83|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_615, ~y$w_buff1~0=v_~y$w_buff1~0_305, ~y$w_buff0~0=v_~y$w_buff0~0_373, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_250, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_83|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_523, ~y~0=v_~y~0_486, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_543} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.offset, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0, ~y~0, ~y$w_buff1_used~0] and [463] L833-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_191 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_549 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_190 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_550 256) 0)))) (.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_486 256) 0)) .cse3))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_125| 0) (= v_~y$w_buff0_used~0_549 (ite .cse0 0 v_~y$w_buff0_used~0_550)) (= v_~y$r_buff0_thd0~0_189 (ite .cse1 0 v_~y$r_buff0_thd0~0_190)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|) (= v_~y~0_430 (ite .cse0 v_~y$w_buff0~0_333 (ite .cse2 v_~y$w_buff1~0_273 v_~y~0_431))) (= v_~y$r_buff1_thd0~0_190 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_485 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_189 256) 0)))) 0 v_~y$r_buff1_thd0~0_191)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| (mod v_~main$tmp_guard1~0_130 256)) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_486) v_~y$w_buff1_used~0_485) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_125|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_122 0) (= 2 v_~__unbuffered_p2_EAX~0_85) (= 2 v_~x~0_103))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_130) (= v_~main$tmp_guard0~0_132 (ite (= (ite (= v_~__unbuffered_cnt~0_509 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_122, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_550, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_190, ~y$w_buff0~0=v_~y$w_buff0~0_333, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_509, ~y~0=v_~y~0_431, ~x~0=v_~x~0_103, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_191, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_486} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_125|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_122, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_111|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_549, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_129|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_130, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_189, ~y$w_buff0~0=v_~y$w_buff0~0_333, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_509, ~y~0=v_~y~0_430, ~x~0=v_~x~0_103, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_190, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:05:13,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [468] L754-->P0EXIT: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff1_thd1~0_176 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_255 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_619 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse3 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_548 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_620 256) 0))))) (and (= v_~y$r_buff1_thd1~0_175 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_547 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd1~0_254 256) 0)) .cse1)) 0 v_~y$r_buff1_thd1~0_176)) (= |v_P0Thread1of1ForFork2_#res#1.offset_85| 0) (= v_~y$w_buff1_used~0_547 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_548)) (= v_~y$r_buff0_thd1~0_254 (ite .cse2 0 v_~y$r_buff0_thd1~0_255)) (= v_~__unbuffered_cnt~0_527 (+ v_~__unbuffered_cnt~0_528 1)) (= v_~y~0_490 (ite .cse4 v_~y$w_buff0~0_375 (ite .cse3 v_~y$w_buff1~0_307 v_~y~0_491))) (= v_~y$w_buff0_used~0_619 (ite .cse4 0 v_~y$w_buff0_used~0_620)) (= |v_P0Thread1of1ForFork2_#res#1.base_85| 0)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_176, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_620, ~y$w_buff1~0=v_~y$w_buff1~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_375, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_255, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_528, ~y~0=v_~y~0_491, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_175, P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_85|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_619, ~y$w_buff1~0=v_~y$w_buff1~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_375, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_254, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_527, ~y~0=v_~y~0_490, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.offset, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0, ~y~0, ~y$w_buff1_used~0] and [463] L833-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_191 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_549 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_190 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_550 256) 0)))) (.cse1 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_486 256) 0)) .cse3))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_125| 0) (= v_~y$w_buff0_used~0_549 (ite .cse0 0 v_~y$w_buff0_used~0_550)) (= v_~y$r_buff0_thd0~0_189 (ite .cse1 0 v_~y$r_buff0_thd0~0_190)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|) (= v_~y~0_430 (ite .cse0 v_~y$w_buff0~0_333 (ite .cse2 v_~y$w_buff1~0_273 v_~y~0_431))) (= v_~y$r_buff1_thd0~0_190 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_485 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_189 256) 0)))) 0 v_~y$r_buff1_thd0~0_191)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103| (mod v_~main$tmp_guard0~0_132 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| (mod v_~main$tmp_guard1~0_130 256)) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_486) v_~y$w_buff1_used~0_485) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_125|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_122 0) (= 2 v_~__unbuffered_p2_EAX~0_85) (= 2 v_~x~0_103))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_130) (= v_~main$tmp_guard0~0_132 (ite (= (ite (= v_~__unbuffered_cnt~0_509 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_122, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_550, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_190, ~y$w_buff0~0=v_~y$w_buff0~0_333, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_509, ~y~0=v_~y~0_431, ~x~0=v_~x~0_103, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_191, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_486} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_125|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_122, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_111|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_549, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_129|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_130, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_132, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_189, ~y$w_buff0~0=v_~y$w_buff0~0_333, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_509, ~y~0=v_~y~0_430, ~x~0=v_~x~0_103, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_190, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_103|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:05:13,959 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:05:13,959 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2045 [2022-12-13 12:05:13,960 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 324 flow [2022-12-13 12:05:13,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:13,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:13,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:13,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:05:13,960 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1993736560, now seen corresponding path program 1 times [2022-12-13 12:05:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:13,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022247779] [2022-12-13 12:05:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:13,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:14,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:14,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:05:14,042 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 12:05:14,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 12:05:14,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 12:05:14,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 12:05:14,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 12:05:14,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 12:05:14,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:05:14,044 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:14,047 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:05:14,047 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:05:14,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:05:14 BasicIcfg [2022-12-13 12:05:14,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:05:14,106 INFO L158 Benchmark]: Toolchain (without parser) took 15246.91ms. Allocated memory was 216.0MB in the beginning and 940.6MB in the end (delta: 724.6MB). Free memory was 190.0MB in the beginning and 303.3MB in the end (delta: -113.3MB). Peak memory consumption was 612.5MB. Max. memory is 8.0GB. [2022-12-13 12:05:14,106 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 193.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:05:14,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.80ms. Allocated memory is still 216.0MB. Free memory was 190.0MB in the beginning and 164.0MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 12:05:14,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.21ms. Allocated memory is still 216.0MB. Free memory was 164.0MB in the beginning and 161.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:05:14,107 INFO L158 Benchmark]: Boogie Preprocessor took 88.12ms. Allocated memory is still 216.0MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:05:14,107 INFO L158 Benchmark]: RCFGBuilder took 727.62ms. Allocated memory is still 216.0MB. Free memory was 159.3MB in the beginning and 124.2MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 12:05:14,112 INFO L158 Benchmark]: TraceAbstraction took 13870.52ms. Allocated memory was 216.0MB in the beginning and 940.6MB in the end (delta: 724.6MB). Free memory was 122.6MB in the beginning and 303.3MB in the end (delta: -180.7MB). Peak memory consumption was 545.4MB. Max. memory is 8.0GB. [2022-12-13 12:05:14,113 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 193.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.80ms. Allocated memory is still 216.0MB. Free memory was 190.0MB in the beginning and 164.0MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.21ms. Allocated memory is still 216.0MB. Free memory was 164.0MB in the beginning and 161.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 88.12ms. Allocated memory is still 216.0MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 727.62ms. Allocated memory is still 216.0MB. Free memory was 159.3MB in the beginning and 124.2MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13870.52ms. Allocated memory was 216.0MB in the beginning and 940.6MB in the end (delta: 724.6MB). Free memory was 122.6MB in the beginning and 303.3MB in the end (delta: -180.7MB). Peak memory consumption was 545.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 111 PlacesBefore, 74 PlacesAfterwards, 103 TransitionsBefore, 65 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 41 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2933, independent: 2783, independent conditional: 2783, independent unconditional: 0, dependent: 150, dependent conditional: 150, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2933, independent: 2783, independent conditional: 0, independent unconditional: 2783, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2933, independent: 2783, independent conditional: 0, independent unconditional: 2783, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2933, independent: 2783, independent conditional: 0, independent unconditional: 2783, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1650, independent: 1605, independent conditional: 0, independent unconditional: 1605, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1650, independent: 1552, independent conditional: 0, independent unconditional: 1552, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 308, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2933, independent: 1178, independent conditional: 0, independent unconditional: 1178, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1650, unknown conditional: 0, unknown unconditional: 1650] , Statistics on independence cache: Total cache size (in pairs): 2728, Positive cache size: 2683, Positive conditional cache size: 0, Positive unconditional cache size: 2683, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202, independent: 168, independent conditional: 18, independent unconditional: 150, dependent: 34, dependent conditional: 14, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 168, independent conditional: 18, independent unconditional: 150, dependent: 34, dependent conditional: 14, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 168, independent conditional: 18, independent unconditional: 150, dependent: 34, dependent conditional: 14, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 173, independent: 149, independent conditional: 18, independent unconditional: 131, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 173, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 90, dependent conditional: 43, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 173, unknown conditional: 26, unknown unconditional: 147] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 149, Positive conditional cache size: 18, Positive unconditional cache size: 131, Negative cache size: 24, Negative conditional cache size: 8, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 197, independent conditional: 197, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 223, independent: 197, independent conditional: 13, independent unconditional: 184, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 223, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 36, unknown conditional: 0, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 180, Positive conditional cache size: 18, Positive unconditional cache size: 162, Negative cache size: 29, Negative conditional cache size: 8, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, independent: 215, independent conditional: 215, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 246, independent: 215, independent conditional: 16, independent unconditional: 199, dependent: 31, dependent conditional: 6, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 193, Positive conditional cache size: 18, Positive unconditional cache size: 175, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 230, independent: 195, independent conditional: 195, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 230, independent: 195, independent conditional: 12, independent unconditional: 183, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 230, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 202, Positive conditional cache size: 18, Positive unconditional cache size: 184, Negative cache size: 34, Negative conditional cache size: 8, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 117, independent conditional: 117, 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: 150, independent: 117, independent conditional: 4, independent unconditional: 113, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 202, Positive conditional cache size: 18, Positive unconditional cache size: 184, Negative cache size: 34, Negative conditional cache size: 8, Negative unconditional cache size: 26, 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: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 144, independent conditional: 5, independent unconditional: 139, dependent: 42, dependent conditional: 1, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 203, Positive conditional cache size: 18, Positive unconditional cache size: 185, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 55 PlacesBefore, 53 PlacesAfterwards, 58 TransitionsBefore, 56 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 388, independent: 306, independent conditional: 306, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 388, independent: 306, independent conditional: 28, independent unconditional: 278, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 388, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 388, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 388, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 207, Positive conditional cache size: 18, Positive unconditional cache size: 189, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 55 PlacesBefore, 54 PlacesAfterwards, 56 TransitionsBefore, 52 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 512, independent: 451, independent conditional: 451, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 512, independent: 451, independent conditional: 393, independent unconditional: 58, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 512, independent: 451, independent conditional: 393, independent unconditional: 58, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 512, independent: 451, independent conditional: 393, independent unconditional: 58, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, independent: 49, independent conditional: 49, independent unconditional: 0, 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: 53, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 512, independent: 402, independent conditional: 344, independent unconditional: 58, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 53, unknown conditional: 53, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 373, Positive conditional cache size: 67, Positive unconditional cache size: 306, Negative cache size: 39, Negative conditional cache size: 12, Negative unconditional cache size: 27, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2393; [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2393, ((void *)0), P0, ((void *)0))=-2, t2393={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] 0 pthread_t t2394; [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2394, ((void *)0), P1, ((void *)0))=-1, t2393={5:0}, t2394={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 pthread_t t2395; [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2395, ((void *)0), P2, ((void *)0))=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$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: 833]: 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: 831]: 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: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 642 IncrementalHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 3 mSDtfsCounter, 642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=7, InterpolantAutomatonStates: 31, 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.5s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:05:14,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...