/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:42:26,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:42:26,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:42:26,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:42:26,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:42:26,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:42:26,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:42:26,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:42:26,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:42:26,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:42:26,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:42:26,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:42:26,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:42:26,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:42:26,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:42:26,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:42:26,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:42:26,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:42:26,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:42:26,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:42:26,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:42:26,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:42:26,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:42:26,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:42:26,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:42:26,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:42:26,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:42:26,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:42:26,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:42:26,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:42:26,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:42:26,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:42:26,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:42:26,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:42:26,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:42:26,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:42:26,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:42:26,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:42:26,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:42:26,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:42:26,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:42:26,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:42:26,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:42:26,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:42:26,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:42:26,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:42:26,773 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:42:26,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:42:26,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:42:26,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:42:26,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:42:26,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:42:26,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:42:26,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:42:26,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:42:26,774 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:42:26,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:42:26,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:42:26,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:42:26,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:42:26,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:42:26,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:42:26,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:42:26,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:42:26,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:42:26,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:42:26,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:42:26,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:42:26,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:42:26,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:42:26,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:42:27,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:42:27,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:42:27,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:42:27,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:42:27,120 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:42:27,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-06 06:42:28,340 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:42:28,604 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:42:28,604 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-06 06:42:28,627 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d12a493/ec13d85c303748e5bec0497e5365d3a1/FLAG78fc9a93d [2022-12-06 06:42:28,639 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d12a493/ec13d85c303748e5bec0497e5365d3a1 [2022-12-06 06:42:28,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:42:28,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:42:28,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:42:28,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:42:28,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:42:28,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:42:28" (1/1) ... [2022-12-06 06:42:28,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2293b680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:28, skipping insertion in model container [2022-12-06 06:42:28,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:42:28" (1/1) ... [2022-12-06 06:42:28,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:42:28,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:42:28,896 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-06 06:42:29,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:42:29,143 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:42:29,156 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-06 06:42:29,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:29,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:29,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:42:29,268 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:42:29,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29 WrapperNode [2022-12-06 06:42:29,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:42:29,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:42:29,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:42:29,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:42:29,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,340 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 06:42:29,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:42:29,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:42:29,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:42:29,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:42:29,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,377 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:42:29,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:42:29,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:42:29,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:42:29,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (1/1) ... [2022-12-06 06:42:29,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:42:29,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:42:29,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:42:29,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:42:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:42:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:42:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:42:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:42:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:42:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:42:29,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:42:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:42:29,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:42:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:42:29,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:42:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:42:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:42:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:42:29,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:42:29,480 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:42:29,671 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:42:29,673 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:42:29,961 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:42:30,133 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:42:30,133 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:42:30,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:42:30 BoogieIcfgContainer [2022-12-06 06:42:30,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:42:30,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:42:30,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:42:30,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:42:30,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:42:28" (1/3) ... [2022-12-06 06:42:30,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e707be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:42:30, skipping insertion in model container [2022-12-06 06:42:30,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:29" (2/3) ... [2022-12-06 06:42:30,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e707be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:42:30, skipping insertion in model container [2022-12-06 06:42:30,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:42:30" (3/3) ... [2022-12-06 06:42:30,147 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-06 06:42:30,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:42:30,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:42:30,163 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:42:30,222 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:42:30,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:42:30,317 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:42:30,317 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:42:30,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:42:30,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:42:30,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 06:42:30,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:30,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:42:30,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 06:42:30,374 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:42:30,374 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:42:30,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:42:30,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:42:30,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 06:42:35,597 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 06:42:35,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:42:35,616 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;@7e767f99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:42:35,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:42:35,619 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 06:42:35,619 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:42:35,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:35,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:42:35,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash 473468, now seen corresponding path program 1 times [2022-12-06 06:42:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:35,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455754153] [2022-12-06 06:42:35,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:42:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:42:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:42:35,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455754153] [2022-12-06 06:42:35,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455754153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:42:35,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:42:35,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:42:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444264039] [2022-12-06 06:42:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:42:36,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:42:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:42:36,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:42:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:42:36,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:42:36,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:36,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:42:36,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:42:36,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:42:36,321 INFO L130 PetriNetUnfolder]: 1106/1719 cut-off events. [2022-12-06 06:42:36,321 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 06:42:36,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3413 conditions, 1719 events. 1106/1719 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8396 event pairs, 308 based on Foata normal form. 0/1538 useless extension candidates. Maximal degree in co-relation 3402. Up to 1336 conditions per place. [2022-12-06 06:42:36,337 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 31 selfloop transitions, 2 changer transitions 8/43 dead transitions. [2022-12-06 06:42:36,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2022-12-06 06:42:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:42:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:42:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:42:36,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 06:42:36,350 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:42:36,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2022-12-06 06:42:36,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:42:36,354 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-06 06:42:36,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 06:42:36,361 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 06:42:36,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:42:36,362 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 52 flow [2022-12-06 06:42:36,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:42:36,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:36,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 52 flow [2022-12-06 06:42:36,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:42:36,372 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:42:36,372 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:42:36,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:42:36,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:42:36,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 06:42:36,500 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:42:36,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 06:42:36,502 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:42:36,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:36,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:36,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:36,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:42:36,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1038675174, now seen corresponding path program 1 times [2022-12-06 06:42:36,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:36,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521689245] [2022-12-06 06:42:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:42:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:42:36,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:42:36,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521689245] [2022-12-06 06:42:36,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521689245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:42:36,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:42:36,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:42:36,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940962036] [2022-12-06 06:42:36,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:42:36,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:42:36,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:42:36,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:42:36,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:42:36,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:42:36,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:36,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:42:36,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:42:36,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:42:36,886 INFO L130 PetriNetUnfolder]: 671/1023 cut-off events. [2022-12-06 06:42:36,887 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-06 06:42:36,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 1023 events. 671/1023 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4393 event pairs, 159 based on Foata normal form. 16/1033 useless extension candidates. Maximal degree in co-relation 2161. Up to 817 conditions per place. [2022-12-06 06:42:36,894 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 06:42:36,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 124 flow [2022-12-06 06:42:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:42:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:42:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:42:36,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-06 06:42:36,896 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:42:36,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 124 flow [2022-12-06 06:42:36,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:42:36,898 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 06:42:36,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 06:42:36,898 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2022-12-06 06:42:36,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:42:36,899 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:42:36,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:42:36,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:36,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:42:36,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:42:36,905 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:42:36,905 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:42:36,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:42:36,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:42:36,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 06:42:36,927 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:42:36,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 06:42:36,930 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 06:42:36,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:36,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:36,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:36,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:42:36,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2134157166, now seen corresponding path program 1 times [2022-12-06 06:42:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:36,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606322044] [2022-12-06 06:42:36,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:36,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:42:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:42:37,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:42:37,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606322044] [2022-12-06 06:42:37,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606322044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:42:37,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:42:37,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:42:37,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4491743] [2022-12-06 06:42:37,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:42:37,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:42:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:42:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:42:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:42:37,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:42:37,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:37,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:42:37,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:42:37,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:42:37,470 INFO L130 PetriNetUnfolder]: 1219/1952 cut-off events. [2022-12-06 06:42:37,471 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-12-06 06:42:37,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 1952 events. 1219/1952 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10260 event pairs, 80 based on Foata normal form. 56/2008 useless extension candidates. Maximal degree in co-relation 4129. Up to 1183 conditions per place. [2022-12-06 06:42:37,482 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 39 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2022-12-06 06:42:37,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 212 flow [2022-12-06 06:42:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:42:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:42:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 06:42:37,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 06:42:37,485 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 52 transitions. [2022-12-06 06:42:37,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 212 flow [2022-12-06 06:42:37,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:42:37,487 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 95 flow [2022-12-06 06:42:37,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-06 06:42:37,489 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 06:42:37,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:42:37,489 INFO L89 Accepts]: Start accepts. Operand has 34 places, 26 transitions, 95 flow [2022-12-06 06:42:37,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:42:37,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:37,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 95 flow [2022-12-06 06:42:37,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 95 flow [2022-12-06 06:42:37,503 INFO L130 PetriNetUnfolder]: 10/75 cut-off events. [2022-12-06 06:42:37,503 INFO L131 PetriNetUnfolder]: For 24/30 co-relation queries the response was YES. [2022-12-06 06:42:37,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 75 events. 10/75 cut-off events. For 24/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 308 event pairs, 3 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 137. Up to 23 conditions per place. [2022-12-06 06:42:37,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 95 flow [2022-12-06 06:42:37,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 06:42:37,520 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:42:37,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 06:42:37,521 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 95 flow [2022-12-06 06:42:37,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:37,522 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:37,522 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:37,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:42:37,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:37,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1672176379, now seen corresponding path program 1 times [2022-12-06 06:42:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:37,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835105113] [2022-12-06 06:42:37,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:42:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:42:37,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:42:37,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835105113] [2022-12-06 06:42:37,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835105113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:42:37,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:42:37,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:42:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046423607] [2022-12-06 06:42:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:42:37,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:42:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:42:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:42:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:42:37,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:42:37,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 95 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:37,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:42:37,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:42:37,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:42:38,200 INFO L130 PetriNetUnfolder]: 2012/3072 cut-off events. [2022-12-06 06:42:38,200 INFO L131 PetriNetUnfolder]: For 1375/1375 co-relation queries the response was YES. [2022-12-06 06:42:38,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7341 conditions, 3072 events. 2012/3072 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15314 event pairs, 412 based on Foata normal form. 92/3164 useless extension candidates. Maximal degree in co-relation 7328. Up to 1218 conditions per place. [2022-12-06 06:42:38,211 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 43 selfloop transitions, 6 changer transitions 11/60 dead transitions. [2022-12-06 06:42:38,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 60 transitions, 308 flow [2022-12-06 06:42:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:42:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:42:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 06:42:38,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:42:38,213 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 95 flow. Second operand 5 states and 55 transitions. [2022-12-06 06:42:38,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 60 transitions, 308 flow [2022-12-06 06:42:38,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:42:38,216 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 124 flow [2022-12-06 06:42:38,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2022-12-06 06:42:38,217 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 06:42:38,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:42:38,217 INFO L89 Accepts]: Start accepts. Operand has 41 places, 26 transitions, 124 flow [2022-12-06 06:42:38,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:42:38,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:38,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 124 flow [2022-12-06 06:42:38,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 124 flow [2022-12-06 06:42:38,226 INFO L130 PetriNetUnfolder]: 5/56 cut-off events. [2022-12-06 06:42:38,227 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 06:42:38,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 56 events. 5/56 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 174 event pairs, 2 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 125. Up to 15 conditions per place. [2022-12-06 06:42:38,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 124 flow [2022-12-06 06:42:38,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 06:42:38,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:42:38,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 06:42:38,307 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 126 flow [2022-12-06 06:42:38,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:38,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:38,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:38,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:42:38,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash 339862312, now seen corresponding path program 1 times [2022-12-06 06:42:38,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:38,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399731463] [2022-12-06 06:42:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:42:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:42:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:42:38,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399731463] [2022-12-06 06:42:38,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399731463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:42:38,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:42:38,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:42:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144545521] [2022-12-06 06:42:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:42:38,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:42:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:42:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:42:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:42:38,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:42:38,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:38,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:42:38,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:42:38,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:42:38,758 INFO L130 PetriNetUnfolder]: 682/1156 cut-off events. [2022-12-06 06:42:38,759 INFO L131 PetriNetUnfolder]: For 1114/1130 co-relation queries the response was YES. [2022-12-06 06:42:38,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 1156 events. 682/1156 cut-off events. For 1114/1130 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5636 event pairs, 152 based on Foata normal form. 109/1261 useless extension candidates. Maximal degree in co-relation 3125. Up to 471 conditions per place. [2022-12-06 06:42:38,765 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 45 selfloop transitions, 5 changer transitions 1/54 dead transitions. [2022-12-06 06:42:38,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 350 flow [2022-12-06 06:42:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:42:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:42:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:42:38,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:42:38,768 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 126 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:42:38,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 350 flow [2022-12-06 06:42:38,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 321 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 06:42:38,781 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 141 flow [2022-12-06 06:42:38,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=141, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-06 06:42:38,783 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 06:42:38,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:42:38,784 INFO L89 Accepts]: Start accepts. Operand has 41 places, 28 transitions, 141 flow [2022-12-06 06:42:38,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:42:38,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:38,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 141 flow [2022-12-06 06:42:38,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 141 flow [2022-12-06 06:42:38,803 INFO L130 PetriNetUnfolder]: 47/141 cut-off events. [2022-12-06 06:42:38,803 INFO L131 PetriNetUnfolder]: For 53/64 co-relation queries the response was YES. [2022-12-06 06:42:38,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 141 events. 47/141 cut-off events. For 53/64 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 671 event pairs, 22 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 334. Up to 82 conditions per place. [2022-12-06 06:42:38,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 141 flow [2022-12-06 06:42:38,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 06:42:38,810 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:42:38,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 06:42:38,813 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 141 flow [2022-12-06 06:42:38,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:38,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:38,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:38,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:42:38,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1634878582, now seen corresponding path program 1 times [2022-12-06 06:42:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:38,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859228947] [2022-12-06 06:42:38,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:42:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:42:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:42:39,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859228947] [2022-12-06 06:42:39,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859228947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:42:39,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:42:39,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:42:39,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498856291] [2022-12-06 06:42:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:42:39,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:42:39,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:42:39,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:42:39,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:42:39,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:42:39,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:39,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:42:39,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:42:39,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:42:39,205 INFO L130 PetriNetUnfolder]: 350/642 cut-off events. [2022-12-06 06:42:39,206 INFO L131 PetriNetUnfolder]: For 583/591 co-relation queries the response was YES. [2022-12-06 06:42:39,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2051 conditions, 642 events. 350/642 cut-off events. For 583/591 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2881 event pairs, 72 based on Foata normal form. 66/704 useless extension candidates. Maximal degree in co-relation 2033. Up to 272 conditions per place. [2022-12-06 06:42:39,210 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 54 selfloop transitions, 8 changer transitions 1/66 dead transitions. [2022-12-06 06:42:39,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 431 flow [2022-12-06 06:42:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:42:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:42:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 06:42:39,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2022-12-06 06:42:39,212 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 141 flow. Second operand 5 states and 62 transitions. [2022-12-06 06:42:39,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 431 flow [2022-12-06 06:42:39,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 421 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:42:39,215 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 181 flow [2022-12-06 06:42:39,215 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-12-06 06:42:39,216 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2022-12-06 06:42:39,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:42:39,216 INFO L89 Accepts]: Start accepts. Operand has 45 places, 31 transitions, 181 flow [2022-12-06 06:42:39,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:42:39,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:39,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 31 transitions, 181 flow [2022-12-06 06:42:39,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 31 transitions, 181 flow [2022-12-06 06:42:39,236 INFO L130 PetriNetUnfolder]: 22/93 cut-off events. [2022-12-06 06:42:39,236 INFO L131 PetriNetUnfolder]: For 101/121 co-relation queries the response was YES. [2022-12-06 06:42:39,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 93 events. 22/93 cut-off events. For 101/121 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 352 event pairs, 4 based on Foata normal form. 6/96 useless extension candidates. Maximal degree in co-relation 286. Up to 49 conditions per place. [2022-12-06 06:42:39,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 181 flow [2022-12-06 06:42:39,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 06:42:39,241 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:42:39,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:42:39,242 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 181 flow [2022-12-06 06:42:39,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:39,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:39,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:39,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:42:39,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash -769028702, now seen corresponding path program 1 times [2022-12-06 06:42:39,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:39,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320088852] [2022-12-06 06:42:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:42:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:42:39,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:42:39,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320088852] [2022-12-06 06:42:39,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320088852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:42:39,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:42:39,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:42:39,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670580488] [2022-12-06 06:42:39,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:42:39,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:42:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:42:39,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:42:39,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:42:39,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:42:39,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-06 06:42:39,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:42:39,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:42:39,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:42:39,665 INFO L130 PetriNetUnfolder]: 230/429 cut-off events. [2022-12-06 06:42:39,665 INFO L131 PetriNetUnfolder]: For 640/646 co-relation queries the response was YES. [2022-12-06 06:42:39,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 429 events. 230/429 cut-off events. For 640/646 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1750 event pairs, 72 based on Foata normal form. 19/444 useless extension candidates. Maximal degree in co-relation 1498. Up to 164 conditions per place. [2022-12-06 06:42:39,669 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 39 selfloop transitions, 11 changer transitions 2/55 dead transitions. [2022-12-06 06:42:39,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 389 flow [2022-12-06 06:42:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:42:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:42:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-12-06 06:42:39,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 06:42:39,671 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 181 flow. Second operand 6 states and 54 transitions. [2022-12-06 06:42:39,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 389 flow [2022-12-06 06:42:39,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 355 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 06:42:39,677 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 190 flow [2022-12-06 06:42:39,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2022-12-06 06:42:39,677 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2022-12-06 06:42:39,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:42:39,678 INFO L89 Accepts]: Start accepts. Operand has 47 places, 31 transitions, 190 flow [2022-12-06 06:42:39,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:42:39,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:39,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 31 transitions, 190 flow [2022-12-06 06:42:39,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 31 transitions, 190 flow [2022-12-06 06:42:39,692 INFO L130 PetriNetUnfolder]: 14/62 cut-off events. [2022-12-06 06:42:39,693 INFO L131 PetriNetUnfolder]: For 100/108 co-relation queries the response was YES. [2022-12-06 06:42:39,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 62 events. 14/62 cut-off events. For 100/108 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 177 event pairs, 0 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 199. Up to 25 conditions per place. [2022-12-06 06:42:39,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 31 transitions, 190 flow [2022-12-06 06:42:39,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 06:42:39,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L816-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [432] L838-3-->L841: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_61) 1 0) 0) 0 1) v_~main$tmp_guard0~0_32) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_7|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 06:42:39,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] L783-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P1Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_9|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [432] L838-3-->L841: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_61) 1 0) 0) 0 1) v_~main$tmp_guard0~0_32) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_7|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 06:42:39,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L763-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P0Thread1of1ForFork2_#res#1.base_13| 0) (= |v_P0Thread1of1ForFork2_#res#1.offset_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_13|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] and [432] L838-3-->L841: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_61) 1 0) 0) 0 1) v_~main$tmp_guard0~0_32) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_7|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 06:42:40,624 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:42:40,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 947 [2022-12-06 06:42:40,625 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 188 flow [2022-12-06 06:42:40,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-06 06:42:40,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:40,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:40,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:42:40,626 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:40,626 INFO L85 PathProgramCache]: Analyzing trace with hash -772981920, now seen corresponding path program 1 times [2022-12-06 06:42:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:40,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060124867] [2022-12-06 06:42:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:40,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:42:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:42:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:42:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060124867] [2022-12-06 06:42:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060124867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:42:41,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:42:41,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:42:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295066663] [2022-12-06 06:42:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:42:41,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:42:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:42:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:42:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:42:41,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:42:41,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:41,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:42:41,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:42:41,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:42:41,663 INFO L130 PetriNetUnfolder]: 226/436 cut-off events. [2022-12-06 06:42:41,663 INFO L131 PetriNetUnfolder]: For 822/822 co-relation queries the response was YES. [2022-12-06 06:42:41,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 436 events. 226/436 cut-off events. For 822/822 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1951 event pairs, 20 based on Foata normal form. 3/439 useless extension candidates. Maximal degree in co-relation 1505. Up to 218 conditions per place. [2022-12-06 06:42:41,666 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 33 selfloop transitions, 6 changer transitions 22/64 dead transitions. [2022-12-06 06:42:41,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 507 flow [2022-12-06 06:42:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:42:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:42:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 06:42:41,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 06:42:41,669 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 188 flow. Second operand 6 states and 56 transitions. [2022-12-06 06:42:41,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 507 flow [2022-12-06 06:42:41,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 397 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 06:42:41,673 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 154 flow [2022-12-06 06:42:41,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2022-12-06 06:42:41,675 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2022-12-06 06:42:41,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:42:41,676 INFO L89 Accepts]: Start accepts. Operand has 42 places, 28 transitions, 154 flow [2022-12-06 06:42:41,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:42:41,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:41,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 28 transitions, 154 flow [2022-12-06 06:42:41,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 154 flow [2022-12-06 06:42:41,686 INFO L130 PetriNetUnfolder]: 13/58 cut-off events. [2022-12-06 06:42:41,686 INFO L131 PetriNetUnfolder]: For 41/43 co-relation queries the response was YES. [2022-12-06 06:42:41,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 58 events. 13/58 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 181 event pairs, 0 based on Foata normal form. 2/59 useless extension candidates. Maximal degree in co-relation 134. Up to 18 conditions per place. [2022-12-06 06:42:41,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 154 flow [2022-12-06 06:42:41,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 06:42:42,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [340] L793-->L809: Formula: (let ((.cse2 (= (mod v_~z$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_128 256) 0)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse9)) (.cse8 (and .cse2 .cse9))) (let ((.cse5 (or .cse11 .cse7 .cse8)) (.cse6 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse4 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse3 (= (mod v_~z$w_buff0_used~0_127 256) 0))) (and (= (ite .cse0 v_~z$r_buff1_thd3~0_56 (ite (let ((.cse1 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~z$r_buff1_thd3~0_56 0)) v_~z$r_buff1_thd3~0_55) (= v_~z$w_buff1~0_61 v_~z$w_buff1~0_60) (= v_~z~0_90 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EBX~0_14)) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_28) (= (ite .cse0 v_~z$w_buff0_used~0_128 (ite .cse5 v_~z$w_buff0_used~0_128 (ite .cse6 0 v_~z$w_buff0_used~0_128))) v_~z$w_buff0_used~0_127) (= v_~z$flush_delayed~0_23 0) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse7 .cse3 .cse8) v_~z$w_buff1_used~0_113 0))) (= v_~z$mem_tmp~0_14 v_~z~0_91) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse5 v_~z~0_91 (ite .cse6 v_~z$w_buff0~0_68 v_~z$w_buff1~0_61))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse9) .cse3 .cse8) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse3) .cse10) 0 v_~z$r_buff0_thd3~0_64)))) (= v_~z$w_buff0~0_68 v_~z$w_buff0~0_67))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_56, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_61, ~z~0=v_~z~0_91, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_67, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_55, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_60, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0] [2022-12-06 06:42:42,658 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:42:42,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 984 [2022-12-06 06:42:42,659 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 150 flow [2022-12-06 06:42:42,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:42:42,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:42:42,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:42,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:42:42,660 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:42:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:42:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1481159073, now seen corresponding path program 1 times [2022-12-06 06:42:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:42:42,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990570925] [2022-12-06 06:42:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:42:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:42:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:42:42,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:42:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:42:42,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:42:42,775 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:42:42,776 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:42:42,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:42:42,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:42:42,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:42:42,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:42:42,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:42:42,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:42:42,781 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:42:42,786 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:42:42,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:42:42,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:42:42 BasicIcfg [2022-12-06 06:42:42,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:42:42,858 INFO L158 Benchmark]: Toolchain (without parser) took 14215.56ms. Allocated memory was 175.1MB in the beginning and 323.0MB in the end (delta: 147.8MB). Free memory was 126.0MB in the beginning and 180.2MB in the end (delta: -54.2MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2022-12-06 06:42:42,858 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:42:42,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.95ms. Allocated memory is still 175.1MB. Free memory was 126.0MB in the beginning and 134.9MB in the end (delta: -8.9MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-12-06 06:42:42,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.39ms. Allocated memory is still 175.1MB. Free memory was 134.9MB in the beginning and 132.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:42:42,859 INFO L158 Benchmark]: Boogie Preprocessor took 56.25ms. Allocated memory is still 175.1MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:42:42,859 INFO L158 Benchmark]: RCFGBuilder took 742.04ms. Allocated memory is still 175.1MB. Free memory was 130.1MB in the beginning and 144.1MB in the end (delta: -13.9MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2022-12-06 06:42:42,859 INFO L158 Benchmark]: TraceAbstraction took 12714.99ms. Allocated memory was 175.1MB in the beginning and 323.0MB in the end (delta: 147.8MB). Free memory was 143.0MB in the beginning and 180.2MB in the end (delta: -37.2MB). Peak memory consumption was 111.2MB. Max. memory is 8.0GB. [2022-12-06 06:42:42,860 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.12ms. Allocated memory is still 127.9MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 625.95ms. Allocated memory is still 175.1MB. Free memory was 126.0MB in the beginning and 134.9MB in the end (delta: -8.9MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.39ms. Allocated memory is still 175.1MB. Free memory was 134.9MB in the beginning and 132.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.25ms. Allocated memory is still 175.1MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 742.04ms. Allocated memory is still 175.1MB. Free memory was 130.1MB in the beginning and 144.1MB in the end (delta: -13.9MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12714.99ms. Allocated memory was 175.1MB in the beginning and 323.0MB in the end (delta: 147.8MB). Free memory was 143.0MB in the beginning and 180.2MB in the end (delta: -37.2MB). Peak memory consumption was 111.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 113 PlacesBefore, 37 PlacesAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1540, independent: 1487, independent conditional: 1487, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1540, independent: 1487, independent conditional: 0, independent unconditional: 1487, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1540, independent: 1487, independent conditional: 0, independent unconditional: 1487, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1540, independent: 1487, independent conditional: 0, independent unconditional: 1487, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1177, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1177, independent: 1132, independent conditional: 0, independent unconditional: 1132, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 320, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1540, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1177, unknown conditional: 0, unknown unconditional: 1177] , Statistics on independence cache: Total cache size (in pairs): 1819, Positive cache size: 1782, Positive conditional cache size: 0, Positive unconditional cache size: 1782, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 77, independent conditional: 15, independent unconditional: 62, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 77, independent conditional: 15, independent unconditional: 62, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 77, independent conditional: 15, independent unconditional: 62, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, independent: 72, independent conditional: 14, independent unconditional: 58, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 124, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 119, dependent conditional: 23, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 91, unknown conditional: 18, unknown unconditional: 73] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 72, Positive conditional cache size: 14, Positive unconditional cache size: 58, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 68, independent conditional: 5, independent unconditional: 63, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 16, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 84, Positive conditional cache size: 14, Positive unconditional cache size: 70, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 103, independent conditional: 103, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 103, independent conditional: 17, independent unconditional: 86, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 87, Positive conditional cache size: 14, Positive unconditional cache size: 73, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 161, independent conditional: 49, independent unconditional: 112, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 108, Positive conditional cache size: 18, Positive unconditional cache size: 90, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 52, independent conditional: 17, independent unconditional: 35, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 52, independent conditional: 3, independent unconditional: 49, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 52, independent conditional: 3, independent unconditional: 49, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 47, independent conditional: 1, independent unconditional: 46, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 113, Positive conditional cache size: 20, Positive unconditional cache size: 93, Negative cache size: 28, Negative conditional cache size: 4, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 21, independent unconditional: 36, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 120, Positive conditional cache size: 20, Positive unconditional cache size: 100, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 47 PlacesBefore, 44 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 90, independent conditional: 18, independent unconditional: 72, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 137, Positive conditional cache size: 22, Positive unconditional cache size: 115, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 41 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 105, independent conditional: 103, independent unconditional: 2, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 105, independent conditional: 91, independent unconditional: 14, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 105, independent conditional: 91, independent unconditional: 14, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137, independent: 97, independent conditional: 85, independent unconditional: 12, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 12, unknown conditional: 10, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 171, Positive conditional cache size: 28, Positive unconditional cache size: 143, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2281; [L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2281, ((void *)0), P0, ((void *)0))=-1, t2281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t2282; [L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2282, ((void *)0), P1, ((void *)0))=0, t2281={5:0}, t2282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t2283; [L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2283, ((void *)0), P2, ((void *)0))=1, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L840] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 2 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 2 !(!cond) [L842] RET 2 assume_abort_if_not(main$tmp_guard0) [L844] 2 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 2 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 2 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 2 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 559 IncrementalHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 3 mSDtfsCounter, 559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred 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.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:42:42,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...