/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/mix056_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:30:24,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:30:24,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:30:24,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:30:24,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:30:24,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:30:24,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:30:24,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:30:24,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:30:24,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:30:24,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:30:24,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:30:24,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:30:24,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:30:24,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:30:24,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:30:24,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:30:24,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:30:24,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:30:24,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:30:24,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:30:24,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:30:24,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:30:24,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:30:24,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:30:24,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:30:24,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:30:24,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:30:24,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:30:24,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:30:24,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:30:24,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:30:24,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:30:24,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:30:24,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:30:24,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:30:24,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:30:24,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:30:24,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:30:24,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:30:24,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:30:24,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:30:24,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:30:24,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:30:24,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:30:24,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:30:24,647 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:30:24,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:30:24,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:30:24,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:30:24,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:30:24,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:30:24,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:30:24,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:30:24,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:30:24,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:30:24,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:30:24,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:30:24,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:30:24,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:30:24,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:30:24,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:30:24,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:30:24,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:24,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:30:24,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:30:24,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:30:24,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:30:24,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:30:24,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:30:24,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:30:24,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:30:25,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:30:25,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:30:25,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:30:25,020 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:30:25,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:30:26,234 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:30:26,547 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:30:26,548 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:30:26,561 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03dbdd35e/3cc4c62d2387459bb26ac6f6dfb7c676/FLAGbc0e0ed96 [2022-12-06 06:30:26,574 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03dbdd35e/3cc4c62d2387459bb26ac6f6dfb7c676 [2022-12-06 06:30:26,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:30:26,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:30:26,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:26,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:30:26,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:30:26,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:26" (1/1) ... [2022-12-06 06:30:26,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9cbef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:26, skipping insertion in model container [2022-12-06 06:30:26,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:26" (1/1) ... [2022-12-06 06:30:26,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:30:26,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:30:26,819 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:30:27,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:27,084 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:30:27,098 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:30:27,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:27,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:27,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:27,175 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:30:27,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27 WrapperNode [2022-12-06 06:30:27,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:27,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:27,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:30:27,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:30:27,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,230 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-06 06:30:27,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:27,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:30:27,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:30:27,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:30:27,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,259 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:30:27,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:30:27,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:30:27,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:30:27,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (1/1) ... [2022-12-06 06:30:27,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:27,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:30:27,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:30:27,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:30:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:30:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:30:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:30:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:30:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:30:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:30:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:30:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:30:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:30:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:30:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:30:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:30:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:30:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:30:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:30:27,374 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:30:27,576 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:30:27,577 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:30:27,788 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:30:27,903 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:30:27,903 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:30:27,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:27 BoogieIcfgContainer [2022-12-06 06:30:27,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:30:27,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:30:27,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:30:27,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:30:27,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:30:26" (1/3) ... [2022-12-06 06:30:27,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9d57fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:27, skipping insertion in model container [2022-12-06 06:30:27,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:27" (2/3) ... [2022-12-06 06:30:27,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9d57fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:27, skipping insertion in model container [2022-12-06 06:30:27,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:27" (3/3) ... [2022-12-06 06:30:27,911 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:30:27,925 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:30:27,925 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:30:27,925 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:30:27,971 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:30:28,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:30:28,051 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:30:28,052 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:28,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:30:28,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:30:28,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 06:30:28,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:28,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:30:28,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 06:30:28,130 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:30:28,131 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:28,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:30:28,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:30:28,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 06:30:31,841 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 06:30:31,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:30:31,865 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;@3b339896, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:30:31,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:30:31,870 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:30:31,870 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:31,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:31,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:30:31,874 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-06 06:30:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash 462838, now seen corresponding path program 1 times [2022-12-06 06:30:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:31,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683756119] [2022-12-06 06:30:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:31,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:32,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683756119] [2022-12-06 06:30:32,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683756119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:32,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:32,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820967241] [2022-12-06 06:30:32,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:32,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:32,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:32,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:32,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:30:32,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:32,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:32,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:30:32,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:32,465 INFO L130 PetriNetUnfolder]: 1290/2069 cut-off events. [2022-12-06 06:30:32,465 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 06:30:32,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4027 conditions, 2069 events. 1290/2069 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11248 event pairs, 207 based on Foata normal form. 0/1888 useless extension candidates. Maximal degree in co-relation 4016. Up to 1549 conditions per place. [2022-12-06 06:30:32,475 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 2 changer transitions 8/45 dead transitions. [2022-12-06 06:30:32,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 191 flow [2022-12-06 06:30:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:30:32,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 06:30:32,484 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 54 transitions. [2022-12-06 06:30:32,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 191 flow [2022-12-06 06:30:32,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:32,487 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-06 06:30:32,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 06:30:32,491 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 06:30:32,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:32,491 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 54 flow [2022-12-06 06:30:32,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:32,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:32,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 54 flow [2022-12-06 06:30:32,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-06 06:30:32,497 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 06:30:32,498 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:32,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:30:32,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-06 06:30:32,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 06:30:32,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:32,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 06:30:32,662 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:30:32,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:32,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:32,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:32,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:30:32,662 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-06 06:30:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1537826934, now seen corresponding path program 1 times [2022-12-06 06:30:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:32,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658587551] [2022-12-06 06:30:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:32,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:32,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658587551] [2022-12-06 06:30:32,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658587551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:32,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:32,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372992941] [2022-12-06 06:30:32,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:32,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:32,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:32,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:32,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:30:32,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:32,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:32,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:30:32,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:33,117 INFO L130 PetriNetUnfolder]: 1767/2677 cut-off events. [2022-12-06 06:30:33,118 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2022-12-06 06:30:33,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 2677 events. 1767/2677 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12924 event pairs, 623 based on Foata normal form. 107/2784 useless extension candidates. Maximal degree in co-relation 5575. Up to 1388 conditions per place. [2022-12-06 06:30:33,129 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2022-12-06 06:30:33,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 162 flow [2022-12-06 06:30:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:30:33,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-06 06:30:33,131 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:30:33,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 162 flow [2022-12-06 06:30:33,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:33,132 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 94 flow [2022-12-06 06:30:33,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-06 06:30:33,133 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places. [2022-12-06 06:30:33,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:33,133 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 94 flow [2022-12-06 06:30:33,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:33,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:33,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 94 flow [2022-12-06 06:30:33,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 94 flow [2022-12-06 06:30:33,148 INFO L130 PetriNetUnfolder]: 48/178 cut-off events. [2022-12-06 06:30:33,149 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 06:30:33,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 178 events. 48/178 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 980 event pairs, 18 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 327. Up to 61 conditions per place. [2022-12-06 06:30:33,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 94 flow [2022-12-06 06:30:33,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 06:30:33,175 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:33,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 06:30:33,177 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 94 flow [2022-12-06 06:30:33,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:33,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:33,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:33,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:30:33,177 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-06 06:30:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash 427992629, now seen corresponding path program 1 times [2022-12-06 06:30:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:33,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383239307] [2022-12-06 06:30:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:33,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383239307] [2022-12-06 06:30:33,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383239307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:33,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:33,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:33,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545172455] [2022-12-06 06:30:33,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:33,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:33,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:33,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:33,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:30:33,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 94 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:33,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:33,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:30:33,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:33,644 INFO L130 PetriNetUnfolder]: 1726/2613 cut-off events. [2022-12-06 06:30:33,644 INFO L131 PetriNetUnfolder]: For 1025/1025 co-relation queries the response was YES. [2022-12-06 06:30:33,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 2613 events. 1726/2613 cut-off events. For 1025/1025 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12410 event pairs, 146 based on Foata normal form. 5/2618 useless extension candidates. Maximal degree in co-relation 6548. Up to 1297 conditions per place. [2022-12-06 06:30:33,657 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 38 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2022-12-06 06:30:33,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 256 flow [2022-12-06 06:30:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:30:33,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 06:30:33,659 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 94 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:30:33,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 256 flow [2022-12-06 06:30:33,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:33,664 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 150 flow [2022-12-06 06:30:33,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 06:30:33,664 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2022-12-06 06:30:33,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:33,665 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 150 flow [2022-12-06 06:30:33,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:33,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:33,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 150 flow [2022-12-06 06:30:33,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 150 flow [2022-12-06 06:30:33,679 INFO L130 PetriNetUnfolder]: 41/160 cut-off events. [2022-12-06 06:30:33,680 INFO L131 PetriNetUnfolder]: For 85/97 co-relation queries the response was YES. [2022-12-06 06:30:33,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 160 events. 41/160 cut-off events. For 85/97 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 840 event pairs, 11 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 352. Up to 54 conditions per place. [2022-12-06 06:30:33,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 150 flow [2022-12-06 06:30:33,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:30:33,683 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:33,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:30:33,684 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 150 flow [2022-12-06 06:30:33,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:33,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:33,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:33,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:30:33,685 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-06 06:30:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 427994024, now seen corresponding path program 1 times [2022-12-06 06:30:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:33,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838743683] [2022-12-06 06:30:33,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:33,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838743683] [2022-12-06 06:30:33,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838743683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:33,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:33,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435951597] [2022-12-06 06:30:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:33,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:33,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:33,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:33,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:30:33,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 150 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:33,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:33,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:30:33,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:34,054 INFO L130 PetriNetUnfolder]: 1687/2554 cut-off events. [2022-12-06 06:30:34,054 INFO L131 PetriNetUnfolder]: For 1962/1962 co-relation queries the response was YES. [2022-12-06 06:30:34,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6956 conditions, 2554 events. 1687/2554 cut-off events. For 1962/1962 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12074 event pairs, 229 based on Foata normal form. 8/2562 useless extension candidates. Maximal degree in co-relation 6941. Up to 1264 conditions per place. [2022-12-06 06:30:34,067 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 43 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2022-12-06 06:30:34,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 344 flow [2022-12-06 06:30:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:30:34,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:30:34,069 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 150 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:30:34,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 344 flow [2022-12-06 06:30:34,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:34,074 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 232 flow [2022-12-06 06:30:34,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-06 06:30:34,075 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-06 06:30:34,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:34,075 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 232 flow [2022-12-06 06:30:34,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:34,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:34,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 232 flow [2022-12-06 06:30:34,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 232 flow [2022-12-06 06:30:34,088 INFO L130 PetriNetUnfolder]: 35/144 cut-off events. [2022-12-06 06:30:34,088 INFO L131 PetriNetUnfolder]: For 234/252 co-relation queries the response was YES. [2022-12-06 06:30:34,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 144 events. 35/144 cut-off events. For 234/252 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 747 event pairs, 5 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 393. Up to 46 conditions per place. [2022-12-06 06:30:34,090 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 232 flow [2022-12-06 06:30:34,090 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 06:30:34,136 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:34,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 06:30:34,137 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 232 flow [2022-12-06 06:30:34,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:34,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:34,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:34,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:30:34,138 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-06 06:30:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash 382868937, now seen corresponding path program 1 times [2022-12-06 06:30:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:34,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105049344] [2022-12-06 06:30:34,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:34,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105049344] [2022-12-06 06:30:34,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105049344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:34,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:34,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586458235] [2022-12-06 06:30:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:34,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:34,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:34,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:34,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:30:34,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:34,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:34,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:30:34,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:34,492 INFO L130 PetriNetUnfolder]: 996/1703 cut-off events. [2022-12-06 06:30:34,493 INFO L131 PetriNetUnfolder]: For 2434/2507 co-relation queries the response was YES. [2022-12-06 06:30:34,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4915 conditions, 1703 events. 996/1703 cut-off events. For 2434/2507 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9274 event pairs, 157 based on Foata normal form. 219/1917 useless extension candidates. Maximal degree in co-relation 4896. Up to 958 conditions per place. [2022-12-06 06:30:34,502 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 63 selfloop transitions, 8 changer transitions 11/91 dead transitions. [2022-12-06 06:30:34,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 91 transitions, 705 flow [2022-12-06 06:30:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 06:30:34,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-06 06:30:34,504 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 232 flow. Second operand 5 states and 66 transitions. [2022-12-06 06:30:34,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 91 transitions, 705 flow [2022-12-06 06:30:34,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 91 transitions, 701 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:34,509 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 290 flow [2022-12-06 06:30:34,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-12-06 06:30:34,509 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 06:30:34,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:34,510 INFO L89 Accepts]: Start accepts. Operand has 48 places, 43 transitions, 290 flow [2022-12-06 06:30:34,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:34,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:34,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 290 flow [2022-12-06 06:30:34,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 290 flow [2022-12-06 06:30:34,538 INFO L130 PetriNetUnfolder]: 138/369 cut-off events. [2022-12-06 06:30:34,538 INFO L131 PetriNetUnfolder]: For 469/550 co-relation queries the response was YES. [2022-12-06 06:30:34,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 369 events. 138/369 cut-off events. For 469/550 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2396 event pairs, 49 based on Foata normal form. 8/349 useless extension candidates. Maximal degree in co-relation 1102. Up to 190 conditions per place. [2022-12-06 06:30:34,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 290 flow [2022-12-06 06:30:34,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 06:30:34,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L836-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [421] L814-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-06 06:30:34,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L836-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [420] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_7| 0) (= |v_P1Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-06 06:30:34,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L836-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~main$tmp_guard0~0_38 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [440] L761-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res#1.base_15| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P0Thread1of1ForFork2_#res#1.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_15|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] [2022-12-06 06:30:34,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:34,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 06:30:34,672 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 296 flow [2022-12-06 06:30:34,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:34,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:34,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:34,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:30:34,673 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-06 06:30:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash 942150050, now seen corresponding path program 1 times [2022-12-06 06:30:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:34,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801009875] [2022-12-06 06:30:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:34,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801009875] [2022-12-06 06:30:34,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801009875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:34,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:34,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299489518] [2022-12-06 06:30:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:34,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:34,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:30:34,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:34,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:34,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:30:34,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:35,055 INFO L130 PetriNetUnfolder]: 1304/2263 cut-off events. [2022-12-06 06:30:35,055 INFO L131 PetriNetUnfolder]: For 4981/4994 co-relation queries the response was YES. [2022-12-06 06:30:35,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8470 conditions, 2263 events. 1304/2263 cut-off events. For 4981/4994 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12936 event pairs, 532 based on Foata normal form. 47/2304 useless extension candidates. Maximal degree in co-relation 8446. Up to 1205 conditions per place. [2022-12-06 06:30:35,067 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 43 selfloop transitions, 7 changer transitions 10/63 dead transitions. [2022-12-06 06:30:35,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 531 flow [2022-12-06 06:30:35,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:30:35,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-06 06:30:35,068 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 296 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:30:35,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 531 flow [2022-12-06 06:30:35,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 512 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:35,075 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 268 flow [2022-12-06 06:30:35,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-06 06:30:35,076 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-06 06:30:35,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:35,076 INFO L89 Accepts]: Start accepts. Operand has 49 places, 37 transitions, 268 flow [2022-12-06 06:30:35,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:35,077 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:35,077 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 268 flow [2022-12-06 06:30:35,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 268 flow [2022-12-06 06:30:35,105 INFO L130 PetriNetUnfolder]: 160/411 cut-off events. [2022-12-06 06:30:35,105 INFO L131 PetriNetUnfolder]: For 621/664 co-relation queries the response was YES. [2022-12-06 06:30:35,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 411 events. 160/411 cut-off events. For 621/664 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2647 event pairs, 70 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 1224. Up to 241 conditions per place. [2022-12-06 06:30:35,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 268 flow [2022-12-06 06:30:35,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 06:30:35,146 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:35,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 06:30:35,147 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 268 flow [2022-12-06 06:30:35,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:35,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:35,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:35,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:30:35,148 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-06 06:30:35,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash -378032532, now seen corresponding path program 1 times [2022-12-06 06:30:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:35,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545085491] [2022-12-06 06:30:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:35,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:35,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545085491] [2022-12-06 06:30:35,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545085491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:35,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:35,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:35,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154189311] [2022-12-06 06:30:35,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:35,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:35,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:35,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:35,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:30:35,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:35,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:35,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:30:35,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:35,468 INFO L130 PetriNetUnfolder]: 670/1255 cut-off events. [2022-12-06 06:30:35,468 INFO L131 PetriNetUnfolder]: For 2171/2197 co-relation queries the response was YES. [2022-12-06 06:30:35,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 1255 events. 670/1255 cut-off events. For 2171/2197 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6978 event pairs, 119 based on Foata normal form. 162/1403 useless extension candidates. Maximal degree in co-relation 4365. Up to 489 conditions per place. [2022-12-06 06:30:35,474 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 60 selfloop transitions, 11 changer transitions 19/97 dead transitions. [2022-12-06 06:30:35,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 828 flow [2022-12-06 06:30:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 06:30:35,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2022-12-06 06:30:35,476 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 268 flow. Second operand 6 states and 80 transitions. [2022-12-06 06:30:35,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 828 flow [2022-12-06 06:30:35,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 97 transitions, 773 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:35,482 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 335 flow [2022-12-06 06:30:35,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-06 06:30:35,483 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 06:30:35,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:35,483 INFO L89 Accepts]: Start accepts. Operand has 53 places, 44 transitions, 335 flow [2022-12-06 06:30:35,483 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:35,484 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:35,484 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 335 flow [2022-12-06 06:30:35,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 335 flow [2022-12-06 06:30:35,504 INFO L130 PetriNetUnfolder]: 87/293 cut-off events. [2022-12-06 06:30:35,505 INFO L131 PetriNetUnfolder]: For 700/797 co-relation queries the response was YES. [2022-12-06 06:30:35,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 293 events. 87/293 cut-off events. For 700/797 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1874 event pairs, 10 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 1135. Up to 183 conditions per place. [2022-12-06 06:30:35,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 335 flow [2022-12-06 06:30:35,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 06:30:35,533 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:35,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 06:30:35,534 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 327 flow [2022-12-06 06:30:35,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:35,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:35,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:35,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:30:35,534 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-06 06:30:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1477489416, now seen corresponding path program 1 times [2022-12-06 06:30:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:35,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880065858] [2022-12-06 06:30:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:35,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:35,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880065858] [2022-12-06 06:30:35,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880065858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:35,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:35,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:30:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844691028] [2022-12-06 06:30:35,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:35,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:35,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:35,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:30:35,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:35,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:35,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:30:35,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:35,861 INFO L130 PetriNetUnfolder]: 422/809 cut-off events. [2022-12-06 06:30:35,861 INFO L131 PetriNetUnfolder]: For 1616/1637 co-relation queries the response was YES. [2022-12-06 06:30:35,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3098 conditions, 809 events. 422/809 cut-off events. For 1616/1637 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4149 event pairs, 110 based on Foata normal form. 49/845 useless extension candidates. Maximal degree in co-relation 3071. Up to 299 conditions per place. [2022-12-06 06:30:35,866 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 44 selfloop transitions, 10 changer transitions 23/81 dead transitions. [2022-12-06 06:30:35,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 678 flow [2022-12-06 06:30:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:30:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:30:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-12-06 06:30:35,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2022-12-06 06:30:35,867 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 327 flow. Second operand 7 states and 72 transitions. [2022-12-06 06:30:35,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 678 flow [2022-12-06 06:30:35,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 654 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 06:30:35,874 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 265 flow [2022-12-06 06:30:35,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2022-12-06 06:30:35,874 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-06 06:30:35,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:35,875 INFO L89 Accepts]: Start accepts. Operand has 57 places, 35 transitions, 265 flow [2022-12-06 06:30:35,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:35,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:35,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 35 transitions, 265 flow [2022-12-06 06:30:35,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 35 transitions, 265 flow [2022-12-06 06:30:35,883 INFO L130 PetriNetUnfolder]: 19/77 cut-off events. [2022-12-06 06:30:35,883 INFO L131 PetriNetUnfolder]: For 152/158 co-relation queries the response was YES. [2022-12-06 06:30:35,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 77 events. 19/77 cut-off events. For 152/158 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 246 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 283. Up to 25 conditions per place. [2022-12-06 06:30:35,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 35 transitions, 265 flow [2022-12-06 06:30:35,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:30:36,187 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:36,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-06 06:30:36,187 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 261 flow [2022-12-06 06:30:36,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:36,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:36,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:36,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:30:36,188 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-06 06:30:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1157189812, now seen corresponding path program 1 times [2022-12-06 06:30:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:36,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783370161] [2022-12-06 06:30:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:36,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783370161] [2022-12-06 06:30:36,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783370161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:36,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:36,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:30:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740816703] [2022-12-06 06:30:36,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:36,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:30:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:30:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:30:36,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:30:36,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:36,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:36,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:30:36,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:36,987 INFO L130 PetriNetUnfolder]: 221/428 cut-off events. [2022-12-06 06:30:36,988 INFO L131 PetriNetUnfolder]: For 1031/1033 co-relation queries the response was YES. [2022-12-06 06:30:36,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 428 events. 221/428 cut-off events. For 1031/1033 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1948 event pairs, 16 based on Foata normal form. 3/430 useless extension candidates. Maximal degree in co-relation 1727. Up to 220 conditions per place. [2022-12-06 06:30:36,994 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 36 selfloop transitions, 4 changer transitions 27/71 dead transitions. [2022-12-06 06:30:36,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 639 flow [2022-12-06 06:30:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-06 06:30:36,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2022-12-06 06:30:36,996 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 261 flow. Second operand 6 states and 55 transitions. [2022-12-06 06:30:36,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 639 flow [2022-12-06 06:30:36,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 527 flow, removed 21 selfloop flow, removed 11 redundant places. [2022-12-06 06:30:37,001 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 214 flow [2022-12-06 06:30:37,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2022-12-06 06:30:37,002 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 06:30:37,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:37,002 INFO L89 Accepts]: Start accepts. Operand has 48 places, 33 transitions, 214 flow [2022-12-06 06:30:37,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:37,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:37,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 33 transitions, 214 flow [2022-12-06 06:30:37,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 214 flow [2022-12-06 06:30:37,012 INFO L130 PetriNetUnfolder]: 20/81 cut-off events. [2022-12-06 06:30:37,012 INFO L131 PetriNetUnfolder]: For 146/153 co-relation queries the response was YES. [2022-12-06 06:30:37,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 81 events. 20/81 cut-off events. For 146/153 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 297 event pairs, 0 based on Foata normal form. 4/85 useless extension candidates. Maximal degree in co-relation 237. Up to 22 conditions per place. [2022-12-06 06:30:37,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 33 transitions, 214 flow [2022-12-06 06:30:37,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-06 06:30:37,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L754-->P0EXIT: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_593 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd1~0_221 256)))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_160 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~z$w_buff1_used~0_521 256))) .cse3)) (.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_594 256) 0)) .cse5))) (and (= |v_P0Thread1of1ForFork2_#res#1.offset_37| 0) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_521) v_~z$w_buff1_used~0_520) (= v_~z$r_buff1_thd1~0_159 (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_220 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_520 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_160)) (= v_~z~0_438 (ite .cse4 v_~z$w_buff0~0_349 (ite .cse1 v_~z$w_buff1~0_312 v_~z~0_439))) (= v_~z$r_buff0_thd1~0_220 (ite .cse0 0 v_~z$r_buff0_thd1~0_221)) (= v_~__unbuffered_cnt~0_207 (+ v_~__unbuffered_cnt~0_208 1)) (= v_~z$w_buff0_used~0_593 (ite .cse4 0 v_~z$w_buff0_used~0_594)) (= |v_P0Thread1of1ForFork2_#res#1.base_37| 0)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_594, ~z$w_buff0~0=v_~z$w_buff0~0_349, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_160, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_521, ~z$w_buff1~0=v_~z$w_buff1~0_312, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_208, ~z~0=v_~z~0_439, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_221} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_37|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_593, ~z$w_buff0~0=v_~z$w_buff0~0_349, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_37|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_520, ~z$w_buff1~0=v_~z$w_buff1~0_312, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, ~z~0=v_~z~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_220} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0, ~z$r_buff0_thd1~0] and [447] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_172 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_547 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_168 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_548 256) 0)))) (.cse1 (and .cse5 .cse3)) (.cse2 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_480 256) 0))))) (and (= v_~z$w_buff0_used~0_547 (ite .cse0 0 v_~z$w_buff0_used~0_548)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~main$tmp_guard1~0_60 (ite (= (ite (not (and (= v_~y~0_73 2) (= v_~x~0_69 2) (= v_~__unbuffered_p2_EAX~0_98 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= v_~z$r_buff0_thd0~0_167 (ite .cse1 0 v_~z$r_buff0_thd0~0_168)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= v_~z~0_398 (ite .cse0 v_~z$w_buff0~0_323 (ite .cse2 v_~z$w_buff1~0_291 v_~z~0_399))) (= v_~z$w_buff1_used~0_479 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_480)) (= v_~z$r_buff1_thd0~0_171 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_167 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_479 256) 0)))) 0 v_~z$r_buff1_thd0~0_172)) (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_197 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_168, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_548, ~z$w_buff0~0=v_~z$w_buff0~0_323, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_172, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_480, ~z$w_buff1~0=v_~z$w_buff1~0_291, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_197, ~z~0=v_~z~0_399, ~y~0=v_~y~0_73, ~x~0=v_~x~0_69} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_547, ~z$w_buff0~0=v_~z$w_buff0~0_323, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_479, ~z$w_buff1~0=v_~z$w_buff1~0_291, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_197, ~z~0=v_~z~0_398, ~y~0=v_~y~0_73, ~x~0=v_~x~0_69, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:30:37,743 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:37,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 742 [2022-12-06 06:30:37,744 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 220 flow [2022-12-06 06:30:37,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:37,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:37,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:37,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:30:37,744 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:30:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1119460633, now seen corresponding path program 1 times [2022-12-06 06:30:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:37,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274253375] [2022-12-06 06:30:37,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:30:37,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:30:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:30:37,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:30:37,939 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:30:37,940 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:30:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:30:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:30:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:30:37,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:30:37,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:30:37,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:30:37,942 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:37,950 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:30:37,950 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:30:38,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:30:38 BasicIcfg [2022-12-06 06:30:38,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:30:38,052 INFO L158 Benchmark]: Toolchain (without parser) took 11475.21ms. Allocated memory was 195.0MB in the beginning and 486.5MB in the end (delta: 291.5MB). Free memory was 169.5MB in the beginning and 420.3MB in the end (delta: -250.9MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. [2022-12-06 06:30:38,052 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory was 171.8MB in the beginning and 171.7MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:30:38,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.84ms. Allocated memory is still 195.0MB. Free memory was 168.9MB in the beginning and 142.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:30:38,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.38ms. Allocated memory is still 195.0MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:30:38,053 INFO L158 Benchmark]: Boogie Preprocessor took 30.92ms. Allocated memory is still 195.0MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:30:38,053 INFO L158 Benchmark]: RCFGBuilder took 642.38ms. Allocated memory is still 195.0MB. Free memory was 138.5MB in the beginning and 103.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:30:38,053 INFO L158 Benchmark]: TraceAbstraction took 10144.60ms. Allocated memory was 195.0MB in the beginning and 486.5MB in the end (delta: 291.5MB). Free memory was 102.9MB in the beginning and 420.3MB in the end (delta: -317.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:30:38,054 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 195.0MB. Free memory was 171.8MB in the beginning and 171.7MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 597.84ms. Allocated memory is still 195.0MB. Free memory was 168.9MB in the beginning and 142.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.38ms. Allocated memory is still 195.0MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.92ms. Allocated memory is still 195.0MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 642.38ms. Allocated memory is still 195.0MB. Free memory was 138.5MB in the beginning and 103.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10144.60ms. Allocated memory was 195.0MB in the beginning and 486.5MB in the end (delta: 291.5MB). Free memory was 102.9MB in the beginning and 420.3MB in the end (delta: -317.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 112 PlacesBefore, 38 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1577, independent: 1524, independent conditional: 1524, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1577, independent: 1524, independent conditional: 0, independent unconditional: 1524, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1577, independent: 1524, independent conditional: 0, independent unconditional: 1524, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1577, independent: 1524, independent conditional: 0, independent unconditional: 1524, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1159, independent: 1126, independent conditional: 0, independent unconditional: 1126, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1159, independent: 1107, independent conditional: 0, independent unconditional: 1107, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 175, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1577, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1159, unknown conditional: 0, unknown unconditional: 1159] , Statistics on independence cache: Total cache size (in pairs): 1776, Positive cache size: 1743, Positive conditional cache size: 0, Positive unconditional cache size: 1743, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 31 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 167, independent conditional: 167, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 212, independent: 167, independent conditional: 32, independent unconditional: 135, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, independent: 167, independent conditional: 32, independent unconditional: 135, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 167, independent conditional: 32, independent unconditional: 135, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 109, independent: 88, independent conditional: 16, independent unconditional: 72, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 109, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 131, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 124, dependent conditional: 56, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 79, independent conditional: 16, independent unconditional: 63, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 109, unknown conditional: 22, unknown unconditional: 87] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 93, Positive conditional cache size: 17, Positive unconditional cache size: 76, Negative cache size: 21, Negative conditional cache size: 6, Negative unconditional cache size: 15, 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, 32 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 15, independent unconditional: 73, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 19, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 107, Positive conditional cache size: 17, Positive unconditional cache size: 90, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 89, independent: 73, independent conditional: 21, independent unconditional: 52, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 89, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 107, Positive conditional cache size: 17, Positive unconditional cache size: 90, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 34, independent conditional: 8, independent unconditional: 26, dependent: 22, dependent conditional: 14, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 115, Positive conditional cache size: 17, Positive unconditional cache size: 98, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 47 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 294, independent: 244, independent conditional: 124, independent unconditional: 120, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, independent: 244, independent conditional: 33, independent unconditional: 211, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 244, independent conditional: 33, independent unconditional: 211, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 236, independent conditional: 31, independent unconditional: 205, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 130, Positive conditional cache size: 21, Positive unconditional cache size: 109, Negative cache size: 34, Negative conditional cache size: 6, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 91, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 130, Positive conditional cache size: 21, Positive unconditional cache size: 109, Negative cache size: 38, Negative conditional cache size: 6, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 235, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 235, independent: 189, independent conditional: 91, independent unconditional: 98, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 235, independent: 189, independent conditional: 29, independent unconditional: 160, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 235, independent: 189, independent conditional: 29, independent unconditional: 160, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 235, independent: 183, independent conditional: 23, independent unconditional: 160, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 136, Positive conditional cache size: 27, Positive unconditional cache size: 109, Negative cache size: 38, Negative conditional cache size: 6, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 55 PlacesBefore, 53 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 78, independent conditional: 38, independent unconditional: 40, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 74, independent conditional: 6, independent unconditional: 68, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 143, Positive conditional cache size: 29, Positive unconditional cache size: 114, Negative cache size: 38, Negative conditional cache size: 6, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 47 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 117, independent conditional: 87, independent unconditional: 30, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 117, independent conditional: 63, independent unconditional: 54, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 117, independent conditional: 63, independent unconditional: 54, dependent: 38, dependent conditional: 23, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 11, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 100, independent conditional: 52, independent unconditional: 48, dependent: 36, dependent conditional: 21, dependent unconditional: 15, unknown: 19, unknown conditional: 13, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 193, Positive conditional cache size: 40, Positive unconditional cache size: 153, Negative cache size: 40, Negative conditional cache size: 8, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, 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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1489, ((void *)0), P0, ((void *)0))=-2, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1490, ((void *)0), P1, ((void *)0))=-1, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1491, ((void *)0), P2, ((void *)0))=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: 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, 134 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: 9.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 655 IncrementalHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 9 mSDtfsCounter, 655 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=7, InterpolantAutomatonStates: 41, 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.6s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:30:38,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...