/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:30:26,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:30:26,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:30:26,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:30:26,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:30:26,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:30:26,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:30:26,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:30:26,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:30:26,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:30:26,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:30:26,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:30:26,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:30:26,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:30:26,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:30:26,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:30:26,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:30:26,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:30:26,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:30:26,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:30:26,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:30:26,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:30:26,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:30:26,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:30:26,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:30:26,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:30:26,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:30:26,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:30:26,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:30:26,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:30:26,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:30:26,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:30:26,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:30:26,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:30:26,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:30:26,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:30:26,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:30:26,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:30:26,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:30:26,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:30:26,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:30:26,819 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:30:26,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:30:26,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:30:26,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:30:26,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:30:26,853 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:30:26,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:30:26,854 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:30:26,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:30:26,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:30:26,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:30:26,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:30:26,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:30:26,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:30:26,855 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:30:26,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:30:26,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:30:26,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:30:26,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:30:26,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:30:26,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:30:26,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:30:26,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:26,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:30:26,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:30:26,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:30:26,857 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:30:26,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:30:26,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:30:26,857 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:30:26,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:30:27,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:30:27,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:30:27,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:30:27,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:30:27,218 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:30:27,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:30:28,412 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:30:28,677 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:30:28,678 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:30:28,700 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b181d03/e8b8a069559b4ead93b47e6ee0bc8168/FLAG572bebec2 [2022-12-13 09:30:28,714 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b181d03/e8b8a069559b4ead93b47e6ee0bc8168 [2022-12-13 09:30:28,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:30:28,718 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:30:28,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:28,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:30:28,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:30:28,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:28" (1/1) ... [2022-12-13 09:30:28,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5dfbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:28, skipping insertion in model container [2022-12-13 09:30:28,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:28" (1/1) ... [2022-12-13 09:30:28,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:30:28,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:30:28,954 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-13 09:30:29,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:29,171 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:30:29,185 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-13 09:30:29,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:29,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:29,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:29,271 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:30:29,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29 WrapperNode [2022-12-13 09:30:29,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:29,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:29,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:30:29,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:30:29,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,313 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2022-12-13 09:30:29,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:29,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:30:29,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:30:29,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:30:29,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,346 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:30:29,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:30:29,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:30:29,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:30:29,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (1/1) ... [2022-12-13 09:30:29,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:29,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:30:29,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:29,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:30:29,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:30:29,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:30:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:30:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:30:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:30:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:30:29,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:30:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:30:29,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:30:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:30:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:30:29,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:30:29,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:30:29,406 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:30:29,601 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:30:29,603 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:30:29,821 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:30:29,940 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:30:29,941 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:30:29,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:29 BoogieIcfgContainer [2022-12-13 09:30:29,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:30:29,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:30:29,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:30:29,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:30:29,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:30:28" (1/3) ... [2022-12-13 09:30:29,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6422ccfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:29, skipping insertion in model container [2022-12-13 09:30:29,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:29" (2/3) ... [2022-12-13 09:30:29,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6422ccfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:29, skipping insertion in model container [2022-12-13 09:30:29,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:29" (3/3) ... [2022-12-13 09:30:29,950 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:30:29,965 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:30:29,965 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:30:29,965 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:30:30,014 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:30:30,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 09:30:30,138 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 09:30:30,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:30,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 09:30:30,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 09:30:30,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-13 09:30:30,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:30,187 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 09:30:30,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-13 09:30:30,211 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 09:30:30,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:30,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 09:30:30,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 09:30:30,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-13 09:30:34,348 INFO L241 LiptonReduction]: Total number of compositions: 73 [2022-12-13 09:30:34,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:30:34,378 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;@747dda18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:34,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:30:34,381 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 09:30:34,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:34,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:34,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:30:34,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:34,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:34,387 INFO L85 PathProgramCache]: Analyzing trace with hash 385772857, now seen corresponding path program 1 times [2022-12-13 09:30:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:34,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607647993] [2022-12-13 09:30:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:34,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607647993] [2022-12-13 09:30:34,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607647993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:34,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:34,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825317204] [2022-12-13 09:30:34,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:34,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:34,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:34,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:34,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2022-12-13 09:30:34,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:34,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:34,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2022-12-13 09:30:34,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:35,107 INFO L130 PetriNetUnfolder]: 904/1963 cut-off events. [2022-12-13 09:30:35,108 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 09:30:35,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 1963 events. 904/1963 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14066 event pairs, 96 based on Foata normal form. 0/1256 useless extension candidates. Maximal degree in co-relation 3459. Up to 1269 conditions per place. [2022-12-13 09:30:35,118 INFO L137 encePairwiseOnDemand]: 41/45 looper letters, 20 selfloop transitions, 2 changer transitions 38/69 dead transitions. [2022-12-13 09:30:35,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 264 flow [2022-12-13 09:30:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-12-13 09:30:35,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:30:35,129 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 96 flow. Second operand 3 states and 90 transitions. [2022-12-13 09:30:35,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 264 flow [2022-12-13 09:30:35,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:35,134 INFO L231 Difference]: Finished difference. Result has 50 places, 24 transitions, 56 flow [2022-12-13 09:30:35,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=50, PETRI_TRANSITIONS=24} [2022-12-13 09:30:35,138 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-12-13 09:30:35,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:35,139 INFO L89 Accepts]: Start accepts. Operand has 50 places, 24 transitions, 56 flow [2022-12-13 09:30:35,141 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:35,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:35,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 24 transitions, 56 flow [2022-12-13 09:30:35,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2022-12-13 09:30:35,147 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 09:30:35,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:35,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 47 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:30:35,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 56 flow [2022-12-13 09:30:35,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 09:30:35,298 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:35,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 09:30:35,299 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 56 flow [2022-12-13 09:30:35,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:35,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:35,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:35,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:30:35,300 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1360612758, now seen corresponding path program 1 times [2022-12-13 09:30:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:35,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479072298] [2022-12-13 09:30:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:35,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:35,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479072298] [2022-12-13 09:30:35,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479072298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:35,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:35,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:35,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796526984] [2022-12-13 09:30:35,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:35,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:35,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:35,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:35,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:35,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 09:30:35,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:35,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:35,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 09:30:35,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:35,524 INFO L130 PetriNetUnfolder]: 300/547 cut-off events. [2022-12-13 09:30:35,524 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 09:30:35,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 547 events. 300/547 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2302 event pairs, 128 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 1086. Up to 496 conditions per place. [2022-12-13 09:30:35,528 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 22 selfloop transitions, 3 changer transitions 2/32 dead transitions. [2022-12-13 09:30:35,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 130 flow [2022-12-13 09:30:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 09:30:35,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-13 09:30:35,529 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 56 flow. Second operand 3 states and 43 transitions. [2022-12-13 09:30:35,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 130 flow [2022-12-13 09:30:35,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:35,530 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 69 flow [2022-12-13 09:30:35,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-13 09:30:35,531 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -20 predicate places. [2022-12-13 09:30:35,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:35,531 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 69 flow [2022-12-13 09:30:35,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:35,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:35,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 69 flow [2022-12-13 09:30:35,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 69 flow [2022-12-13 09:30:35,537 INFO L130 PetriNetUnfolder]: 3/41 cut-off events. [2022-12-13 09:30:35,537 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:35,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2022-12-13 09:30:35,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 69 flow [2022-12-13 09:30:35,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 09:30:35,566 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:35,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 09:30:35,567 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 69 flow [2022-12-13 09:30:35,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:35,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:35,568 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:35,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:30:35,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash -770678106, now seen corresponding path program 1 times [2022-12-13 09:30:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:35,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156477335] [2022-12-13 09:30:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:35,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156477335] [2022-12-13 09:30:35,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156477335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:35,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:35,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081185007] [2022-12-13 09:30:35,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:35,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:35,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 09:30:35,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 09:30:35,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:35,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 09:30:35,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:35,888 INFO L130 PetriNetUnfolder]: 282/549 cut-off events. [2022-12-13 09:30:35,888 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-13 09:30:35,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 549 events. 282/549 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2521 event pairs, 73 based on Foata normal form. 38/502 useless extension candidates. Maximal degree in co-relation 1136. Up to 203 conditions per place. [2022-12-13 09:30:35,891 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 27 selfloop transitions, 5 changer transitions 3/40 dead transitions. [2022-12-13 09:30:35,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 171 flow [2022-12-13 09:30:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-13 09:30:35,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2022-12-13 09:30:35,893 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 69 flow. Second operand 4 states and 55 transitions. [2022-12-13 09:30:35,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 171 flow [2022-12-13 09:30:35,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:30:35,894 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 104 flow [2022-12-13 09:30:35,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-13 09:30:35,895 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2022-12-13 09:30:35,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:35,895 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 104 flow [2022-12-13 09:30:35,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:35,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:35,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 104 flow [2022-12-13 09:30:35,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 104 flow [2022-12-13 09:30:35,905 INFO L130 PetriNetUnfolder]: 8/67 cut-off events. [2022-12-13 09:30:35,905 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 09:30:35,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 67 events. 8/67 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 239 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 118. Up to 16 conditions per place. [2022-12-13 09:30:35,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 104 flow [2022-12-13 09:30:35,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 09:30:35,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:35,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 09:30:35,999 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 108 flow [2022-12-13 09:30:35,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 09:30:35,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:35,999 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:36,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:30:36,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash 777834021, now seen corresponding path program 1 times [2022-12-13 09:30:36,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:36,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926600285] [2022-12-13 09:30:36,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:36,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:36,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926600285] [2022-12-13 09:30:36,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926600285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:36,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:36,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:36,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088502824] [2022-12-13 09:30:36,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:36,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:36,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:36,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:36,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:36,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 09:30:36,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 09:30:36,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:36,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 09:30:36,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:36,306 INFO L130 PetriNetUnfolder]: 267/512 cut-off events. [2022-12-13 09:30:36,306 INFO L131 PetriNetUnfolder]: For 282/282 co-relation queries the response was YES. [2022-12-13 09:30:36,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 512 events. 267/512 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2314 event pairs, 89 based on Foata normal form. 4/440 useless extension candidates. Maximal degree in co-relation 1273. Up to 170 conditions per place. [2022-12-13 09:30:36,309 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 26 selfloop transitions, 5 changer transitions 6/42 dead transitions. [2022-12-13 09:30:36,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 222 flow [2022-12-13 09:30:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 09:30:36,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 09:30:36,312 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 108 flow. Second operand 4 states and 54 transitions. [2022-12-13 09:30:36,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 222 flow [2022-12-13 09:30:36,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 207 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:36,317 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 123 flow [2022-12-13 09:30:36,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 09:30:36,319 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2022-12-13 09:30:36,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:36,319 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 123 flow [2022-12-13 09:30:36,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:36,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:36,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 123 flow [2022-12-13 09:30:36,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 123 flow [2022-12-13 09:30:36,325 INFO L130 PetriNetUnfolder]: 5/52 cut-off events. [2022-12-13 09:30:36,325 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 09:30:36,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 52 events. 5/52 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 201 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 104. Up to 11 conditions per place. [2022-12-13 09:30:36,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 123 flow [2022-12-13 09:30:36,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 09:30:36,393 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:36,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 09:30:36,395 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 123 flow [2022-12-13 09:30:36,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 09:30:36,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:36,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:36,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:30:36,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash 777939731, now seen corresponding path program 1 times [2022-12-13 09:30:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:36,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195235177] [2022-12-13 09:30:36,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:36,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:36,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195235177] [2022-12-13 09:30:36,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195235177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:36,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:36,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280313609] [2022-12-13 09:30:36,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:36,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:36,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:36,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:36,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:36,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 09:30:36,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-13 09:30:36,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:36,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 09:30:36,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:36,646 INFO L130 PetriNetUnfolder]: 196/421 cut-off events. [2022-12-13 09:30:36,646 INFO L131 PetriNetUnfolder]: For 321/321 co-relation queries the response was YES. [2022-12-13 09:30:36,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 421 events. 196/421 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2071 event pairs, 53 based on Foata normal form. 18/325 useless extension candidates. Maximal degree in co-relation 1100. Up to 373 conditions per place. [2022-12-13 09:30:36,649 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 7 changer transitions 5/43 dead transitions. [2022-12-13 09:30:36,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 246 flow [2022-12-13 09:30:36,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-13 09:30:36,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2022-12-13 09:30:36,651 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 123 flow. Second operand 3 states and 50 transitions. [2022-12-13 09:30:36,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 246 flow [2022-12-13 09:30:36,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 229 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 09:30:36,656 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 155 flow [2022-12-13 09:30:36,656 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-13 09:30:36,658 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2022-12-13 09:30:36,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:36,659 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 155 flow [2022-12-13 09:30:36,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:36,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:36,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 155 flow [2022-12-13 09:30:36,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 34 transitions, 155 flow [2022-12-13 09:30:36,677 INFO L130 PetriNetUnfolder]: 61/193 cut-off events. [2022-12-13 09:30:36,678 INFO L131 PetriNetUnfolder]: For 17/20 co-relation queries the response was YES. [2022-12-13 09:30:36,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 193 events. 61/193 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1083 event pairs, 18 based on Foata normal form. 3/128 useless extension candidates. Maximal degree in co-relation 393. Up to 127 conditions per place. [2022-12-13 09:30:36,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 34 transitions, 155 flow [2022-12-13 09:30:36,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-13 09:30:36,681 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:36,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 09:30:36,682 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 155 flow [2022-12-13 09:30:36,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-13 09:30:36,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:36,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:36,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:30:36,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:36,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash -878956870, now seen corresponding path program 1 times [2022-12-13 09:30:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:36,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374259023] [2022-12-13 09:30:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:36,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:36,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374259023] [2022-12-13 09:30:36,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374259023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:36,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:36,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:30:36,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431584186] [2022-12-13 09:30:36,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:36,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:36,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:36,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:36,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-13 09:30:36,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 09:30:36,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:36,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-13 09:30:36,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:36,944 INFO L130 PetriNetUnfolder]: 308/680 cut-off events. [2022-12-13 09:30:36,944 INFO L131 PetriNetUnfolder]: For 359/371 co-relation queries the response was YES. [2022-12-13 09:30:36,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 680 events. 308/680 cut-off events. For 359/371 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4120 event pairs, 64 based on Foata normal form. 25/601 useless extension candidates. Maximal degree in co-relation 2024. Up to 381 conditions per place. [2022-12-13 09:30:36,947 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 29 selfloop transitions, 8 changer transitions 21/63 dead transitions. [2022-12-13 09:30:36,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 63 transitions, 387 flow [2022-12-13 09:30:36,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 09:30:36,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2022-12-13 09:30:36,948 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 155 flow. Second operand 4 states and 59 transitions. [2022-12-13 09:30:36,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 63 transitions, 387 flow [2022-12-13 09:30:36,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:30:36,950 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 178 flow [2022-12-13 09:30:36,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 09:30:36,951 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2022-12-13 09:30:36,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:36,951 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 178 flow [2022-12-13 09:30:36,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:36,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:36,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 178 flow [2022-12-13 09:30:36,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 178 flow [2022-12-13 09:30:36,967 INFO L130 PetriNetUnfolder]: 60/197 cut-off events. [2022-12-13 09:30:36,968 INFO L131 PetriNetUnfolder]: For 54/57 co-relation queries the response was YES. [2022-12-13 09:30:36,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 197 events. 60/197 cut-off events. For 54/57 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1143 event pairs, 21 based on Foata normal form. 3/126 useless extension candidates. Maximal degree in co-relation 411. Up to 136 conditions per place. [2022-12-13 09:30:36,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 178 flow [2022-12-13 09:30:36,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-13 09:30:36,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [279] L780-->L783: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [316] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_25 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_25, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 09:30:37,200 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:30:37,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-13 09:30:37,201 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 179 flow [2022-12-13 09:30:37,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 09:30:37,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:37,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:37,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:30:37,202 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:37,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -958365442, now seen corresponding path program 1 times [2022-12-13 09:30:37,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:37,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321572233] [2022-12-13 09:30:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:37,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:37,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:37,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321572233] [2022-12-13 09:30:37,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321572233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:37,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:37,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:30:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822213184] [2022-12-13 09:30:37,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:37,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:37,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:37,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-13 09:30:37,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:37,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:37,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-13 09:30:37,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:37,462 INFO L130 PetriNetUnfolder]: 42/159 cut-off events. [2022-12-13 09:30:37,462 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-13 09:30:37,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 159 events. 42/159 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 771 event pairs, 2 based on Foata normal form. 33/146 useless extension candidates. Maximal degree in co-relation 531. Up to 88 conditions per place. [2022-12-13 09:30:37,464 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 19 selfloop transitions, 13 changer transitions 1/36 dead transitions. [2022-12-13 09:30:37,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 282 flow [2022-12-13 09:30:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-13 09:30:37,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-13 09:30:37,466 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 179 flow. Second operand 4 states and 42 transitions. [2022-12-13 09:30:37,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 282 flow [2022-12-13 09:30:37,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 254 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 09:30:37,469 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 194 flow [2022-12-13 09:30:37,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 09:30:37,470 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2022-12-13 09:30:37,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:37,470 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 194 flow [2022-12-13 09:30:37,470 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:37,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:37,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 194 flow [2022-12-13 09:30:37,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 194 flow [2022-12-13 09:30:37,481 INFO L130 PetriNetUnfolder]: 21/121 cut-off events. [2022-12-13 09:30:37,482 INFO L131 PetriNetUnfolder]: For 37/43 co-relation queries the response was YES. [2022-12-13 09:30:37,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 121 events. 21/121 cut-off events. For 37/43 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 643 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 349. Up to 73 conditions per place. [2022-12-13 09:30:37,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 194 flow [2022-12-13 09:30:37,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 09:30:38,020 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:30:38,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 551 [2022-12-13 09:30:38,022 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 190 flow [2022-12-13 09:30:38,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:38,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:38,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:38,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:30:38,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1504010631, now seen corresponding path program 1 times [2022-12-13 09:30:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:38,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994910129] [2022-12-13 09:30:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:38,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:38,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:38,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994910129] [2022-12-13 09:30:38,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994910129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:38,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:38,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695213077] [2022-12-13 09:30:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:38,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:30:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:30:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:30:38,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-13 09:30:38,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:38,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:38,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-13 09:30:38,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:38,265 INFO L130 PetriNetUnfolder]: 48/144 cut-off events. [2022-12-13 09:30:38,265 INFO L131 PetriNetUnfolder]: For 224/228 co-relation queries the response was YES. [2022-12-13 09:30:38,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 144 events. 48/144 cut-off events. For 224/228 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 688 event pairs, 5 based on Foata normal form. 12/124 useless extension candidates. Maximal degree in co-relation 603. Up to 101 conditions per place. [2022-12-13 09:30:38,266 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 19 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2022-12-13 09:30:38,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 336 flow [2022-12-13 09:30:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:30:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:30:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 09:30:38,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43 [2022-12-13 09:30:38,268 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 190 flow. Second operand 5 states and 43 transitions. [2022-12-13 09:30:38,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 336 flow [2022-12-13 09:30:38,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 292 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:38,271 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 120 flow [2022-12-13 09:30:38,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2022-12-13 09:30:38,273 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2022-12-13 09:30:38,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:38,273 INFO L89 Accepts]: Start accepts. Operand has 40 places, 23 transitions, 120 flow [2022-12-13 09:30:38,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:38,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:38,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 23 transitions, 120 flow [2022-12-13 09:30:38,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 120 flow [2022-12-13 09:30:38,281 INFO L130 PetriNetUnfolder]: 9/43 cut-off events. [2022-12-13 09:30:38,281 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 09:30:38,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 43 events. 9/43 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 147 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 119. Up to 28 conditions per place. [2022-12-13 09:30:38,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 120 flow [2022-12-13 09:30:38,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 09:30:38,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L783-->L789: Formula: (and (= v_~y~0_183 v_~__unbuffered_p1_EAX~0_137) (= v_~y~0_183 v_~__unbuffered_p1_EBX~0_156)) InVars {~y~0=v_~y~0_183} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_156, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_137, ~y~0=v_~y~0_183} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0] and [316] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_25 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_25, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 09:30:38,437 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:30:38,438 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 09:30:38,438 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 110 flow [2022-12-13 09:30:38,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:38,438 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:38,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:38,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:30:38,439 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1390880846, now seen corresponding path program 1 times [2022-12-13 09:30:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:38,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320199631] [2022-12-13 09:30:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320199631] [2022-12-13 09:30:38,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320199631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:38,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:38,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822240948] [2022-12-13 09:30:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:38,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:38,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:38,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 15 [2022-12-13 09:30:38,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:38,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:38,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 15 [2022-12-13 09:30:38,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:39,010 INFO L130 PetriNetUnfolder]: 22/75 cut-off events. [2022-12-13 09:30:39,010 INFO L131 PetriNetUnfolder]: For 155/157 co-relation queries the response was YES. [2022-12-13 09:30:39,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 75 events. 22/75 cut-off events. For 155/157 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 322 event pairs, 0 based on Foata normal form. 11/68 useless extension candidates. Maximal degree in co-relation 245. Up to 46 conditions per place. [2022-12-13 09:30:39,011 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 14 selfloop transitions, 4 changer transitions 9/32 dead transitions. [2022-12-13 09:30:39,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 220 flow [2022-12-13 09:30:39,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:30:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-13 09:30:39,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 09:30:39,012 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 110 flow. Second operand 6 states and 38 transitions. [2022-12-13 09:30:39,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 220 flow [2022-12-13 09:30:39,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 199 flow, removed 5 selfloop flow, removed 8 redundant places. [2022-12-13 09:30:39,013 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 103 flow [2022-12-13 09:30:39,013 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-13 09:30:39,014 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -20 predicate places. [2022-12-13 09:30:39,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:39,014 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 103 flow [2022-12-13 09:30:39,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:39,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:39,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 103 flow [2022-12-13 09:30:39,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 103 flow [2022-12-13 09:30:39,021 INFO L130 PetriNetUnfolder]: 9/45 cut-off events. [2022-12-13 09:30:39,021 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 09:30:39,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 45 events. 9/45 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 152 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 132. Up to 28 conditions per place. [2022-12-13 09:30:39,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 103 flow [2022-12-13 09:30:39,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 09:30:39,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [398] L789-->P1EXIT: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_157 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_390 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_391 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_353 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_157) v_~x$r_buff0_thd2~0_156) (= (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_352 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_156 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_125) v_~x$r_buff1_thd2~0_124) (= v_~x$w_buff1_used~0_352 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_353)) (= (ite .cse4 0 v_~x$w_buff0_used~0_391) v_~x$w_buff0_used~0_390) (= v_~__unbuffered_cnt~0_247 (+ v_~__unbuffered_cnt~0_248 1)) (= (ite .cse4 v_~x$w_buff0~0_263 (ite .cse3 v_~x$w_buff1~0_228 v_~x~0_311)) v_~x~0_310) (= |v_P1Thread1of1ForFork0_#res#1.base_43| 0) (= |v_P1Thread1of1ForFork0_#res#1.offset_43| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_263, ~x$w_buff1~0=v_~x$w_buff1~0_228, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_353, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_248, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_157, ~x~0=v_~x~0_311, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_263, ~x$w_buff1~0=v_~x$w_buff1~0_228, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_352, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_247, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_43|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_156, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_43|, ~x~0=v_~x~0_310, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_390} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [395] L816-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_149 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_382 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_142 256) 0)))) (let ((.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_347 256) 0)))) (.cse4 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_383 256) 0))))) (and (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_245 2) 1 0)) 0 1) v_~main$tmp_guard0~0_76) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_203 0) (= v_~y~0_199 2) (= v_~__unbuffered_p1_EAX~0_145 1) (= v_~__unbuffered_p1_EBX~0_164 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_132) (= (ite .cse0 v_~x$w_buff0~0_257 (ite .cse1 v_~x$w_buff1~0_224 v_~x~0_307)) v_~x~0_306) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| 0)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_346 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_148 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_142) v_~x$r_buff1_thd0~0_141) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| (mod v_~main$tmp_guard1~0_132 256)) (= v_~x$r_buff0_thd0~0_148 (ite .cse4 0 v_~x$r_buff0_thd0~0_149)) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_347) v_~x$w_buff1_used~0_346) (= v_~x$w_buff0_used~0_382 (ite .cse0 0 v_~x$w_buff0_used~0_383)) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_149, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_203, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_164, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_145, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_245, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~y~0=v_~y~0_199, ~x~0=v_~x~0_307, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_148, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_107|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_164, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_346, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_141, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_382, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_43|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_77|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_245, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_89|, ~y~0=v_~y~0_199, ~x~0=v_~x~0_306, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 09:30:40,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [402] L789-->L799: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_141 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_406 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_173 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_369 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_407 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_271 (ite .cse1 v_~x$w_buff1~0_236 v_~x~0_327)) v_~x~0_326) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_173) v_~x$r_buff0_thd2~0_172) (= v_~x$w_buff1_used~0_368 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_369)) (= v_~__unbuffered_cnt~0_263 (+ v_~__unbuffered_cnt~0_264 1)) (= (ite .cse0 0 v_~x$w_buff0_used~0_407) v_~x$w_buff0_used~0_406) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_368 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_172 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_141) v_~x$r_buff1_thd2~0_140)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_271, ~x$w_buff1~0=v_~x$w_buff1~0_236, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_369, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_264, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_173, ~x~0=v_~x~0_327, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_407} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_271, ~x$w_buff1~0=v_~x$w_buff1~0_236, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_140, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_263, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_172, ~x~0=v_~x~0_326, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_406} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [395] L816-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_149 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_382 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_142 256) 0)))) (let ((.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_347 256) 0)))) (.cse4 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_383 256) 0))))) (and (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_245 2) 1 0)) 0 1) v_~main$tmp_guard0~0_76) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_203 0) (= v_~y~0_199 2) (= v_~__unbuffered_p1_EAX~0_145 1) (= v_~__unbuffered_p1_EBX~0_164 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_132) (= (ite .cse0 v_~x$w_buff0~0_257 (ite .cse1 v_~x$w_buff1~0_224 v_~x~0_307)) v_~x~0_306) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| 0)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_346 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_148 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_142) v_~x$r_buff1_thd0~0_141) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| (mod v_~main$tmp_guard1~0_132 256)) (= v_~x$r_buff0_thd0~0_148 (ite .cse4 0 v_~x$r_buff0_thd0~0_149)) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_347) v_~x$w_buff1_used~0_346) (= v_~x$w_buff0_used~0_382 (ite .cse0 0 v_~x$w_buff0_used~0_383)) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_149, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_203, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_164, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_145, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_245, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~y~0=v_~y~0_199, ~x~0=v_~x~0_307, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_148, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_107|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_164, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_346, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_141, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_382, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_43|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_77|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_245, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_89|, ~y~0=v_~y~0_199, ~x~0=v_~x~0_306, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 09:30:40,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L789-->P1FINAL: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_177 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_410 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_411 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_373 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_411) v_~x$w_buff0_used~0_410) (= v_~__unbuffered_cnt~0_267 (+ v_~__unbuffered_cnt~0_268 1)) (= v_~x$w_buff1_used~0_372 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_373)) (= |v_P1Thread1of1ForFork0_#res#1.base_49| 0) (= v_~x$r_buff0_thd2~0_176 (ite .cse1 0 v_~x$r_buff0_thd2~0_177)) (= |v_P1Thread1of1ForFork0_#res#1.offset_49| 0) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_176 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_372 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_145) v_~x$r_buff1_thd2~0_144) (= (ite .cse0 v_~x$w_buff0~0_273 (ite .cse2 v_~x$w_buff1~0_238 v_~x~0_331)) v_~x~0_330)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_273, ~x$w_buff1~0=v_~x$w_buff1~0_238, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_145, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_373, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x~0=v_~x~0_331, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_411} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_273, ~x$w_buff1~0=v_~x$w_buff1~0_238, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_144, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_372, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_267, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_49|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_176, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_49|, ~x~0=v_~x~0_330, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_410} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [395] L816-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_149 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_382 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd0~0_142 256) 0)))) (let ((.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_347 256) 0)))) (.cse4 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_383 256) 0))))) (and (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_245 2) 1 0)) 0 1) v_~main$tmp_guard0~0_76) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_203 0) (= v_~y~0_199 2) (= v_~__unbuffered_p1_EAX~0_145 1) (= v_~__unbuffered_p1_EBX~0_164 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_132) (= (ite .cse0 v_~x$w_buff0~0_257 (ite .cse1 v_~x$w_buff1~0_224 v_~x~0_307)) v_~x~0_306) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| 0)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_346 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_148 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_142) v_~x$r_buff1_thd0~0_141) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123| (mod v_~main$tmp_guard1~0_132 256)) (= v_~x$r_buff0_thd0~0_148 (ite .cse4 0 v_~x$r_buff0_thd0~0_149)) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_347) v_~x$w_buff1_used~0_346) (= v_~x$w_buff0_used~0_382 (ite .cse0 0 v_~x$w_buff0_used~0_383)) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_149, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_203, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_164, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_145, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_245, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~y~0=v_~y~0_199, ~x~0=v_~x~0_307, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_383} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_148, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_107|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_164, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_346, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_141, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_382, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_123|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_145, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_43|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_77|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_245, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_89|, ~y~0=v_~y~0_199, ~x~0=v_~x~0_306, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 09:30:42,862 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:30:42,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3849 [2022-12-13 09:30:42,863 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 153 flow [2022-12-13 09:30:42,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:42,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:42,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 09:30:42,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:30:42,867 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:30:42,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash -925939475, now seen corresponding path program 1 times [2022-12-13 09:30:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:42,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404691856] [2022-12-13 09:30:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:42,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:30:42,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:30:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:30:42,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:30:42,959 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:30:42,960 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:30:42,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 09:30:42,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:30:42,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:30:42,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 09:30:42,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:30:42,962 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:42,966 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:30:42,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:30:43,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:30:43 BasicIcfg [2022-12-13 09:30:43,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:30:43,023 INFO L158 Benchmark]: Toolchain (without parser) took 14304.85ms. Allocated memory was 199.2MB in the beginning and 380.6MB in the end (delta: 181.4MB). Free memory was 174.8MB in the beginning and 265.9MB in the end (delta: -91.1MB). Peak memory consumption was 91.6MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,023 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 199.2MB. Free memory is still 175.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:30:43,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.46ms. Allocated memory is still 199.2MB. Free memory was 174.5MB in the beginning and 149.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.07ms. Allocated memory is still 199.2MB. Free memory was 149.4MB in the beginning and 146.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,024 INFO L158 Benchmark]: Boogie Preprocessor took 36.43ms. Allocated memory is still 199.2MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,024 INFO L158 Benchmark]: RCFGBuilder took 592.07ms. Allocated memory is still 199.2MB. Free memory was 145.2MB in the beginning and 115.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,024 INFO L158 Benchmark]: TraceAbstraction took 13077.37ms. Allocated memory was 199.2MB in the beginning and 380.6MB in the end (delta: 181.4MB). Free memory was 114.8MB in the beginning and 265.9MB in the end (delta: -151.1MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,026 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 199.2MB. Free memory is still 175.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 552.46ms. Allocated memory is still 199.2MB. Free memory was 174.5MB in the beginning and 149.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.07ms. Allocated memory is still 199.2MB. Free memory was 149.4MB in the beginning and 146.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.43ms. Allocated memory is still 199.2MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 592.07ms. Allocated memory is still 199.2MB. Free memory was 145.2MB in the beginning and 115.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 13077.37ms. Allocated memory was 199.2MB in the beginning and 380.6MB in the end (delta: 181.4MB). Free memory was 114.8MB in the beginning and 265.9MB in the end (delta: -151.1MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 93 PlacesBefore, 52 PlacesAfterwards, 88 TransitionsBefore, 45 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 3 ChoiceCompositions, 73 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1667, independent: 1526, independent conditional: 1526, independent unconditional: 0, dependent: 141, dependent conditional: 141, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1037, independent: 986, independent conditional: 0, independent unconditional: 986, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1037, independent: 986, independent conditional: 0, independent unconditional: 986, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1037, independent: 976, independent conditional: 0, independent unconditional: 976, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1667, independent: 540, independent conditional: 540, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 1037, unknown conditional: 1037, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1042, Positive cache size: 991, Positive conditional cache size: 991, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 172, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 113, independent conditional: 5, independent unconditional: 108, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 134, independent: 113, independent conditional: 5, independent unconditional: 108, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 134, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 143, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 121, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 134, unknown conditional: 134, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 113, Positive conditional cache size: 113, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 4, independent unconditional: 22, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 4, independent unconditional: 22, 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: 31, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 67, dependent conditional: 58, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 159, Positive conditional cache size: 159, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 167, Positive conditional cache size: 167, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 32, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 173, Positive conditional cache size: 173, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 41, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 177, Positive conditional cache size: 177, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 39 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 29 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 179, Positive conditional cache size: 179, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 38 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 189, Positive conditional cache size: 189, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 31 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 34, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1633, ((void *)0), P0, ((void *)0))=6, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1634, ((void *)0), P1, ((void *)0))=7, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 [L782] 2 y = 1 [L785] 2 __unbuffered_p1_EAX = y [L788] 2 __unbuffered_p1_EBX = y [L741] 2 y = 2 [L746] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 2 x$flush_delayed = weak$$choice2 [L749] 2 x$mem_tmp = x [L750] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 2 __unbuffered_p0_EAX = x [L758] 2 x = x$flush_delayed ? x$mem_tmp : x [L759] 2 x$flush_delayed = (_Bool)0 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L820] RET 2 assume_abort_if_not(main$tmp_guard0) [L822] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 2 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L829] 2 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 10 mSDtfsCounter, 423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 355 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-13 09:30:43,066 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...