/usr/bin/java -Xmx16000000000 -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/mix019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 09:58:08,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 09:58:08,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 09:58:08,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 09:58:08,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 09:58:08,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 09:58:08,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 09:58:08,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 09:58:08,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 09:58:08,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 09:58:08,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 09:58:08,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 09:58:08,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 09:58:08,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 09:58:08,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 09:58:08,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 09:58:08,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 09:58:08,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 09:58:08,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 09:58:08,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 09:58:08,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 09:58:08,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 09:58:08,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 09:58:08,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 09:58:08,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 09:58:08,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 09:58:08,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 09:58:08,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 09:58:08,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 09:58:08,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 09:58:08,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 09:58:08,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 09:58:08,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 09:58:08,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 09:58:08,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 09:58:08,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 09:58:08,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 09:58:08,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 09:58:08,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 09:58:08,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 09:58:08,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 09:58:08,668 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 [2021-03-26 09:58:08,703 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 09:58:08,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 09:58:08,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 09:58:08,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 09:58:08,707 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 09:58:08,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 09:58:08,708 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 09:58:08,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 09:58:08,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 09:58:08,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 09:58:08,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 09:58:08,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 09:58:08,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 09:58:08,710 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 09:58:08,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 09:58:08,710 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 09:58:08,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 09:58:08,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 09:58:08,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 09:58:08,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 09:58:08,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 09:58:08,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:58:08,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 09:58:08,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 09:58:08,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 09:58:08,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 09:58:08,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 09:58:08,712 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 09:58:08,712 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 09:58:08,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 09:58:08,713 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-03-26 09:58:09,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 09:58:09,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 09:58:09,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 09:58:09,031 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 09:58:09,032 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 09:58:09,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2021-03-26 09:58:09,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f78625c2/553408ed7c8447fc9d69ee40ee4a50f7/FLAGa41d278e3 [2021-03-26 09:58:09,560 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 09:58:09,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2021-03-26 09:58:09,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f78625c2/553408ed7c8447fc9d69ee40ee4a50f7/FLAGa41d278e3 [2021-03-26 09:58:09,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f78625c2/553408ed7c8447fc9d69ee40ee4a50f7 [2021-03-26 09:58:09,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 09:58:09,885 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 09:58:09,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 09:58:09,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 09:58:09,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 09:58:09,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:58:09" (1/1) ... [2021-03-26 09:58:09,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:09, skipping insertion in model container [2021-03-26 09:58:09,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:58:09" (1/1) ... [2021-03-26 09:58:09,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 09:58:09,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 09:58:10,082 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i[951,964] [2021-03-26 09:58:10,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:58:10,289 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 09:58:10,299 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i[951,964] [2021-03-26 09:58:10,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:58:10,441 INFO L208 MainTranslator]: Completed translation [2021-03-26 09:58:10,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10 WrapperNode [2021-03-26 09:58:10,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 09:58:10,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 09:58:10,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 09:58:10,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 09:58:10,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 09:58:10,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 09:58:10,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 09:58:10,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 09:58:10,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... [2021-03-26 09:58:10,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 09:58:10,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 09:58:10,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 09:58:10,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 09:58:10,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:58:10,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 09:58:10,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 09:58:10,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 09:58:10,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 09:58:10,624 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 09:58:10,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 09:58:10,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 09:58:10,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 09:58:10,625 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 09:58:10,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 09:58:10,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 09:58:10,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 09:58:10,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 09:58:10,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 09:58:10,627 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 09:58:12,337 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 09:58:12,337 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 09:58:12,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:58:12 BoogieIcfgContainer [2021-03-26 09:58:12,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 09:58:12,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 09:58:12,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 09:58:12,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 09:58:12,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 09:58:09" (1/3) ... [2021-03-26 09:58:12,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1454f265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:58:12, skipping insertion in model container [2021-03-26 09:58:12,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:58:10" (2/3) ... [2021-03-26 09:58:12,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1454f265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:58:12, skipping insertion in model container [2021-03-26 09:58:12,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:58:12" (3/3) ... [2021-03-26 09:58:12,346 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc.i [2021-03-26 09:58:12,352 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 09:58:12,356 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 09:58:12,357 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 09:58:12,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,396 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,396 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,396 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,396 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,397 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,402 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,402 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,402 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,402 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,406 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,406 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,406 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,407 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,443 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:58:12,445 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 09:58:12,462 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 09:58:12,491 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 09:58:12,492 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 09:58:12,492 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 09:58:12,492 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 09:58:12,492 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 09:58:12,492 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 09:58:12,493 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 09:58:12,496 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 09:58:12,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 09:58:12,540 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 09:58:12,540 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:58:12,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 09:58:12,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 09:58:12,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-26 09:58:12,549 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:12,562 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 09:58:12,564 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 09:58:12,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-26 09:58:12,583 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 09:58:12,583 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:58:12,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 09:58:12,586 INFO L142 LiptonReduction]: Number of co-enabled transitions 1778 [2021-03-26 09:58:13,850 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 09:58:14,250 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 09:58:14,387 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 09:58:15,453 INFO L154 LiptonReduction]: Checked pairs total: 3086 [2021-03-26 09:58:15,453 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 09:58:15,455 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2907 [2021-03-26 09:58:15,463 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 09:58:15,463 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:58:15,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:15,464 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:15,464 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash 699704113, now seen corresponding path program 1 times [2021-03-26 09:58:15,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:15,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716908792] [2021-03-26 09:58:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:15,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:15,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:58:15,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:15,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:15,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716908792] [2021-03-26 09:58:15,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:15,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:58:15,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725286657] [2021-03-26 09:58:15,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:58:15,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:15,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:58:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:58:15,712 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 164 [2021-03-26 09:58:15,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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) [2021-03-26 09:58:15,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:15,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 164 [2021-03-26 09:58:15,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:15,812 INFO L129 PetriNetUnfolder]: 49/143 cut-off events. [2021-03-26 09:58:15,813 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:58:15,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 143 events. 49/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 571 event pairs, 38 based on Foata normal form. 17/151 useless extension candidates. Maximal degree in co-relation 219. Up to 65 conditions per place. [2021-03-26 09:58:15,818 INFO L132 encePairwiseOnDemand]: 160/164 looper letters, 9 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-26 09:58:15,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 115 flow [2021-03-26 09:58:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:58:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:58:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-26 09:58:15,837 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9065040650406504 [2021-03-26 09:58:15,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-26 09:58:15,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-26 09:58:15,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:15,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-26 09:58:15,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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) [2021-03-26 09:58:15,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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) [2021-03-26 09:58:15,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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) [2021-03-26 09:58:15,862 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 446 transitions. [2021-03-26 09:58:15,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 115 flow [2021-03-26 09:58:15,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 09:58:15,866 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2021-03-26 09:58:15,868 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 09:58:15,868 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 09:58:15,868 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:15,869 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 09:58:15,870 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 09:58:15,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 86 flow [2021-03-26 09:58:15,880 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-26 09:58:15,880 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:58:15,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 09:58:15,881 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 09:58:16,450 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 09:58:16,595 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 09:58:17,545 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2021-03-26 09:58:17,702 INFO L154 LiptonReduction]: Checked pairs total: 1610 [2021-03-26 09:58:17,702 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 09:58:17,702 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1834 [2021-03-26 09:58:17,703 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 09:58:17,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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) [2021-03-26 09:58:17,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:17,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:17,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 09:58:17,704 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1973046455, now seen corresponding path program 1 times [2021-03-26 09:58:17,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:17,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23230124] [2021-03-26 09:58:17,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:17,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:17,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:58:17,794 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 09:58:17,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 09:58:17,806 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 09:58:17,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:58:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:17,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23230124] [2021-03-26 09:58:17,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:17,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:58:17,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550977726] [2021-03-26 09:58:17,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:58:17,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:17,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:58:17,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:58:17,819 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 177 [2021-03-26 09:58:17,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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) [2021-03-26 09:58:17,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:17,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 177 [2021-03-26 09:58:17,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:17,923 INFO L129 PetriNetUnfolder]: 101/282 cut-off events. [2021-03-26 09:58:17,923 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:58:17,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 282 events. 101/282 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1578 event pairs, 20 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 467. Up to 81 conditions per place. [2021-03-26 09:58:17,927 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 6 selfloop transitions, 6 changer transitions 12/41 dead transitions. [2021-03-26 09:58:17,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 140 flow [2021-03-26 09:58:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:58:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:58:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2021-03-26 09:58:17,930 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8248587570621468 [2021-03-26 09:58:17,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2021-03-26 09:58:17,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2021-03-26 09:58:17,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:17,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2021-03-26 09:58:17,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 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) [2021-03-26 09:58:17,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 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) [2021-03-26 09:58:17,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 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) [2021-03-26 09:58:17,935 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 730 transitions. [2021-03-26 09:58:17,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 140 flow [2021-03-26 09:58:17,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:58:17,936 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 110 flow [2021-03-26 09:58:17,937 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-26 09:58:17,937 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2021-03-26 09:58:17,937 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:17,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 110 flow [2021-03-26 09:58:17,938 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 110 flow [2021-03-26 09:58:17,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 110 flow [2021-03-26 09:58:17,959 INFO L129 PetriNetUnfolder]: 48/167 cut-off events. [2021-03-26 09:58:17,959 INFO L130 PetriNetUnfolder]: For 45/51 co-relation queries the response was YES. [2021-03-26 09:58:17,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 167 events. 48/167 cut-off events. For 45/51 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 861 event pairs, 21 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 345. Up to 81 conditions per place. [2021-03-26 09:58:17,964 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-26 09:58:18,570 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 09:58:18,726 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 09:58:19,086 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 09:58:19,254 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 09:58:19,265 INFO L154 LiptonReduction]: Checked pairs total: 717 [2021-03-26 09:58:19,266 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:58:19,266 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1329 [2021-03-26 09:58:19,267 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 106 flow [2021-03-26 09:58:19,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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) [2021-03-26 09:58:19,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:19,268 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:19,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 09:58:19,268 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1635572796, now seen corresponding path program 1 times [2021-03-26 09:58:19,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:19,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87026497] [2021-03-26 09:58:19,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:19,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:19,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:19,365 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 09:58:19,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 09:58:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:19,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87026497] [2021-03-26 09:58:19,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:19,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:58:19,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801565363] [2021-03-26 09:58:19,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:58:19,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:58:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:58:19,374 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 179 [2021-03-26 09:58:19,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 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) [2021-03-26 09:58:19,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:19,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 179 [2021-03-26 09:58:19,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:19,415 INFO L129 PetriNetUnfolder]: 39/138 cut-off events. [2021-03-26 09:58:19,416 INFO L130 PetriNetUnfolder]: For 62/131 co-relation queries the response was YES. [2021-03-26 09:58:19,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 138 events. 39/138 cut-off events. For 62/131 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 602 event pairs, 6 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 374. Up to 68 conditions per place. [2021-03-26 09:58:19,417 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 9 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2021-03-26 09:58:19,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 162 flow [2021-03-26 09:58:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:58:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:58:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2021-03-26 09:58:19,419 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.835195530726257 [2021-03-26 09:58:19,419 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2021-03-26 09:58:19,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2021-03-26 09:58:19,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:19,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2021-03-26 09:58:19,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 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) [2021-03-26 09:58:19,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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) [2021-03-26 09:58:19,423 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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) [2021-03-26 09:58:19,423 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 106 flow. Second operand 4 states and 598 transitions. [2021-03-26 09:58:19,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 162 flow [2021-03-26 09:58:19,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 132 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-26 09:58:19,426 INFO L241 Difference]: Finished difference. Result has 37 places, 30 transitions, 132 flow [2021-03-26 09:58:19,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2021-03-26 09:58:19,426 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2021-03-26 09:58:19,426 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:19,426 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 132 flow [2021-03-26 09:58:19,427 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 132 flow [2021-03-26 09:58:19,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 132 flow [2021-03-26 09:58:19,443 INFO L129 PetriNetUnfolder]: 39/148 cut-off events. [2021-03-26 09:58:19,443 INFO L130 PetriNetUnfolder]: For 66/72 co-relation queries the response was YES. [2021-03-26 09:58:19,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 148 events. 39/148 cut-off events. For 66/72 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 730 event pairs, 10 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 317. Up to 68 conditions per place. [2021-03-26 09:58:19,445 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 09:58:19,451 INFO L154 LiptonReduction]: Checked pairs total: 312 [2021-03-26 09:58:19,451 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:58:19,451 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 09:58:19,452 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 132 flow [2021-03-26 09:58:19,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 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) [2021-03-26 09:58:19,453 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:19,453 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:19,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 09:58:19,453 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2119533396, now seen corresponding path program 1 times [2021-03-26 09:58:19,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:19,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374888905] [2021-03-26 09:58:19,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:19,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:19,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:19,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374888905] [2021-03-26 09:58:19,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:19,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 09:58:19,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693511310] [2021-03-26 09:58:19,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:58:19,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:58:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:58:19,493 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 179 [2021-03-26 09:58:19,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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) [2021-03-26 09:58:19,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:19,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 179 [2021-03-26 09:58:19,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:19,514 INFO L129 PetriNetUnfolder]: 33/128 cut-off events. [2021-03-26 09:58:19,514 INFO L130 PetriNetUnfolder]: For 108/116 co-relation queries the response was YES. [2021-03-26 09:58:19,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 128 events. 33/128 cut-off events. For 108/116 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 569 event pairs, 13 based on Foata normal form. 2/126 useless extension candidates. Maximal degree in co-relation 308. Up to 60 conditions per place. [2021-03-26 09:58:19,515 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 6 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2021-03-26 09:58:19,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 172 flow [2021-03-26 09:58:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:58:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:58:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-03-26 09:58:19,517 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8789571694599627 [2021-03-26 09:58:19,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-03-26 09:58:19,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-03-26 09:58:19,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:19,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-03-26 09:58:19,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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) [2021-03-26 09:58:19,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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) [2021-03-26 09:58:19,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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) [2021-03-26 09:58:19,520 INFO L185 Difference]: Start difference. First operand has 37 places, 30 transitions, 132 flow. Second operand 3 states and 472 transitions. [2021-03-26 09:58:19,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 172 flow [2021-03-26 09:58:19,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:58:19,522 INFO L241 Difference]: Finished difference. Result has 39 places, 33 transitions, 170 flow [2021-03-26 09:58:19,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2021-03-26 09:58:19,523 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2021-03-26 09:58:19,523 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:19,523 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 170 flow [2021-03-26 09:58:19,523 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 170 flow [2021-03-26 09:58:19,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 170 flow [2021-03-26 09:58:19,537 INFO L129 PetriNetUnfolder]: 33/132 cut-off events. [2021-03-26 09:58:19,537 INFO L130 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2021-03-26 09:58:19,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 132 events. 33/132 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 619 event pairs, 9 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 314. Up to 60 conditions per place. [2021-03-26 09:58:19,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 328 [2021-03-26 09:58:19,544 INFO L154 LiptonReduction]: Checked pairs total: 363 [2021-03-26 09:58:19,544 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:58:19,544 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 09:58:19,545 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 170 flow [2021-03-26 09:58:19,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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) [2021-03-26 09:58:19,546 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:19,546 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:19,546 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 09:58:19,546 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash -608457108, now seen corresponding path program 1 times [2021-03-26 09:58:19,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:19,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581081820] [2021-03-26 09:58:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:19,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:19,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:19,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:19,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 09:58:19,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:19,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:58:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:19,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581081820] [2021-03-26 09:58:19,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:19,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:58:19,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587294791] [2021-03-26 09:58:19,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:58:19,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:58:19,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:58:19,596 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-26 09:58:19,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 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) [2021-03-26 09:58:19,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:19,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-26 09:58:19,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:19,666 INFO L129 PetriNetUnfolder]: 137/365 cut-off events. [2021-03-26 09:58:19,666 INFO L130 PetriNetUnfolder]: For 131/158 co-relation queries the response was YES. [2021-03-26 09:58:19,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 365 events. 137/365 cut-off events. For 131/158 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2320 event pairs, 55 based on Foata normal form. 36/379 useless extension candidates. Maximal degree in co-relation 826. Up to 195 conditions per place. [2021-03-26 09:58:19,669 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 8 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2021-03-26 09:58:19,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 222 flow [2021-03-26 09:58:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:58:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:58:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2021-03-26 09:58:19,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8636871508379889 [2021-03-26 09:58:19,672 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2021-03-26 09:58:19,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2021-03-26 09:58:19,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:19,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2021-03-26 09:58:19,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 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) [2021-03-26 09:58:19,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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) [2021-03-26 09:58:19,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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) [2021-03-26 09:58:19,677 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 170 flow. Second operand 5 states and 773 transitions. [2021-03-26 09:58:19,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 222 flow [2021-03-26 09:58:19,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 215 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 09:58:19,682 INFO L241 Difference]: Finished difference. Result has 45 places, 40 transitions, 223 flow [2021-03-26 09:58:19,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2021-03-26 09:58:19,682 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2021-03-26 09:58:19,683 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:19,683 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 223 flow [2021-03-26 09:58:19,683 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 223 flow [2021-03-26 09:58:19,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 223 flow [2021-03-26 09:58:19,714 INFO L129 PetriNetUnfolder]: 124/335 cut-off events. [2021-03-26 09:58:19,714 INFO L130 PetriNetUnfolder]: For 279/363 co-relation queries the response was YES. [2021-03-26 09:58:19,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 335 events. 124/335 cut-off events. For 279/363 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2133 event pairs, 46 based on Foata normal form. 10/317 useless extension candidates. Maximal degree in co-relation 946. Up to 173 conditions per place. [2021-03-26 09:58:19,718 INFO L142 LiptonReduction]: Number of co-enabled transitions 474 [2021-03-26 09:58:19,736 INFO L154 LiptonReduction]: Checked pairs total: 804 [2021-03-26 09:58:19,736 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:58:19,737 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 54 [2021-03-26 09:58:19,739 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 217 flow [2021-03-26 09:58:19,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 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) [2021-03-26 09:58:19,740 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:19,740 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:19,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 09:58:19,740 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:19,741 INFO L82 PathProgramCache]: Analyzing trace with hash -66227740, now seen corresponding path program 1 times [2021-03-26 09:58:19,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:19,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504713952] [2021-03-26 09:58:19,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:19,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:19,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:58:19,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:19,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:19,823 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 09:58:19,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 09:58:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:19,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504713952] [2021-03-26 09:58:19,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:19,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:58:19,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064552391] [2021-03-26 09:58:19,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:58:19,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:19,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:58:19,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:58:19,834 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 179 [2021-03-26 09:58:19,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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) [2021-03-26 09:58:19,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:19,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 179 [2021-03-26 09:58:19,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:19,903 INFO L129 PetriNetUnfolder]: 144/371 cut-off events. [2021-03-26 09:58:19,903 INFO L130 PetriNetUnfolder]: For 463/609 co-relation queries the response was YES. [2021-03-26 09:58:19,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 371 events. 144/371 cut-off events. For 463/609 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2281 event pairs, 66 based on Foata normal form. 25/367 useless extension candidates. Maximal degree in co-relation 1106. Up to 210 conditions per place. [2021-03-26 09:58:19,906 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 9 selfloop transitions, 9 changer transitions 4/40 dead transitions. [2021-03-26 09:58:19,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 265 flow [2021-03-26 09:58:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:58:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:58:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2021-03-26 09:58:19,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8365921787709497 [2021-03-26 09:58:19,909 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2021-03-26 09:58:19,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2021-03-26 09:58:19,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:19,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2021-03-26 09:58:19,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 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) [2021-03-26 09:58:19,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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) [2021-03-26 09:58:19,912 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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) [2021-03-26 09:58:19,912 INFO L185 Difference]: Start difference. First operand has 45 places, 39 transitions, 217 flow. Second operand 4 states and 599 transitions. [2021-03-26 09:58:19,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 265 flow [2021-03-26 09:58:19,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 259 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 09:58:19,916 INFO L241 Difference]: Finished difference. Result has 46 places, 35 transitions, 220 flow [2021-03-26 09:58:19,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2021-03-26 09:58:19,916 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2021-03-26 09:58:19,917 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:19,917 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 220 flow [2021-03-26 09:58:19,917 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 220 flow [2021-03-26 09:58:19,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 220 flow [2021-03-26 09:58:19,953 INFO L129 PetriNetUnfolder]: 128/332 cut-off events. [2021-03-26 09:58:19,953 INFO L130 PetriNetUnfolder]: For 324/361 co-relation queries the response was YES. [2021-03-26 09:58:19,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 332 events. 128/332 cut-off events. For 324/361 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1950 event pairs, 56 based on Foata normal form. 2/314 useless extension candidates. Maximal degree in co-relation 896. Up to 193 conditions per place. [2021-03-26 09:58:19,957 INFO L142 LiptonReduction]: Number of co-enabled transitions 330 [2021-03-26 09:58:19,965 INFO L154 LiptonReduction]: Checked pairs total: 246 [2021-03-26 09:58:19,966 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:58:19,966 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-26 09:58:19,971 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 220 flow [2021-03-26 09:58:19,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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) [2021-03-26 09:58:19,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:19,972 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:19,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 09:58:19,972 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:19,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash -431449297, now seen corresponding path program 1 times [2021-03-26 09:58:19,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:19,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512774713] [2021-03-26 09:58:19,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:20,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:58:20,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:20,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:20,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512774713] [2021-03-26 09:58:20,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:20,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:58:20,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899520954] [2021-03-26 09:58:20,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:58:20,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:58:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:58:20,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-26 09:58:20,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 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) [2021-03-26 09:58:20,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:20,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-26 09:58:20,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:20,113 INFO L129 PetriNetUnfolder]: 204/512 cut-off events. [2021-03-26 09:58:20,114 INFO L130 PetriNetUnfolder]: For 767/896 co-relation queries the response was YES. [2021-03-26 09:58:20,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 512 events. 204/512 cut-off events. For 767/896 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3447 event pairs, 97 based on Foata normal form. 15/485 useless extension candidates. Maximal degree in co-relation 1422. Up to 317 conditions per place. [2021-03-26 09:58:20,116 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 6 selfloop transitions, 3 changer transitions 1/37 dead transitions. [2021-03-26 09:58:20,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 251 flow [2021-03-26 09:58:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:58:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:58:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 612 transitions. [2021-03-26 09:58:20,118 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8547486033519553 [2021-03-26 09:58:20,118 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 612 transitions. [2021-03-26 09:58:20,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 612 transitions. [2021-03-26 09:58:20,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:20,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 612 transitions. [2021-03-26 09:58:20,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 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) [2021-03-26 09:58:20,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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) [2021-03-26 09:58:20,121 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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) [2021-03-26 09:58:20,121 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 220 flow. Second operand 4 states and 612 transitions. [2021-03-26 09:58:20,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 251 flow [2021-03-26 09:58:20,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 235 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 09:58:20,124 INFO L241 Difference]: Finished difference. Result has 50 places, 36 transitions, 224 flow [2021-03-26 09:58:20,124 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2021-03-26 09:58:20,125 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2021-03-26 09:58:20,125 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:20,125 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 224 flow [2021-03-26 09:58:20,125 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 224 flow [2021-03-26 09:58:20,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 224 flow [2021-03-26 09:58:20,168 INFO L129 PetriNetUnfolder]: 203/507 cut-off events. [2021-03-26 09:58:20,169 INFO L130 PetriNetUnfolder]: For 579/628 co-relation queries the response was YES. [2021-03-26 09:58:20,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 507 events. 203/507 cut-off events. For 579/628 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3372 event pairs, 99 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 1390. Up to 318 conditions per place. [2021-03-26 09:58:20,173 INFO L142 LiptonReduction]: Number of co-enabled transitions 338 [2021-03-26 09:58:20,241 INFO L154 LiptonReduction]: Checked pairs total: 471 [2021-03-26 09:58:20,241 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:58:20,242 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-03-26 09:58:20,244 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 230 flow [2021-03-26 09:58:20,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 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) [2021-03-26 09:58:20,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:20,244 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:20,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 09:58:20,245 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:20,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash -737650491, now seen corresponding path program 2 times [2021-03-26 09:58:20,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:20,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502193228] [2021-03-26 09:58:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:20,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:20,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:20,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 09:58:20,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:58:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:20,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502193228] [2021-03-26 09:58:20,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:20,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:58:20,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572572933] [2021-03-26 09:58:20,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:58:20,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:20,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:58:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:58:20,324 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 181 [2021-03-26 09:58:20,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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) [2021-03-26 09:58:20,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:20,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 181 [2021-03-26 09:58:20,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:20,402 INFO L129 PetriNetUnfolder]: 124/378 cut-off events. [2021-03-26 09:58:20,402 INFO L130 PetriNetUnfolder]: For 479/642 co-relation queries the response was YES. [2021-03-26 09:58:20,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 378 events. 124/378 cut-off events. For 479/642 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2480 event pairs, 19 based on Foata normal form. 106/473 useless extension candidates. Maximal degree in co-relation 1307. Up to 252 conditions per place. [2021-03-26 09:58:20,404 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 11 changer transitions 5/46 dead transitions. [2021-03-26 09:58:20,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 326 flow [2021-03-26 09:58:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:58:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:58:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 939 transitions. [2021-03-26 09:58:20,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8646408839779005 [2021-03-26 09:58:20,407 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 939 transitions. [2021-03-26 09:58:20,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 939 transitions. [2021-03-26 09:58:20,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:20,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 939 transitions. [2021-03-26 09:58:20,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 156.5) internal successors, (939), 6 states have internal predecessors, (939), 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) [2021-03-26 09:58:20,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 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) [2021-03-26 09:58:20,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 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) [2021-03-26 09:58:20,411 INFO L185 Difference]: Start difference. First operand has 50 places, 36 transitions, 230 flow. Second operand 6 states and 939 transitions. [2021-03-26 09:58:20,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 326 flow [2021-03-26 09:58:20,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:58:20,414 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 298 flow [2021-03-26 09:58:20,414 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-26 09:58:20,414 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2021-03-26 09:58:20,414 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:20,415 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 41 transitions, 298 flow [2021-03-26 09:58:20,415 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 41 transitions, 298 flow [2021-03-26 09:58:20,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 41 transitions, 298 flow [2021-03-26 09:58:20,452 INFO L129 PetriNetUnfolder]: 108/355 cut-off events. [2021-03-26 09:58:20,452 INFO L130 PetriNetUnfolder]: For 842/934 co-relation queries the response was YES. [2021-03-26 09:58:20,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 355 events. 108/355 cut-off events. For 842/934 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2345 event pairs, 19 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 1366. Up to 234 conditions per place. [2021-03-26 09:58:20,457 INFO L142 LiptonReduction]: Number of co-enabled transitions 376 [2021-03-26 09:58:20,520 INFO L154 LiptonReduction]: Checked pairs total: 632 [2021-03-26 09:58:20,520 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:58:20,521 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-26 09:58:20,521 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 290 flow [2021-03-26 09:58:20,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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) [2021-03-26 09:58:20,522 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:20,522 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:20,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 09:58:20,522 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194670, now seen corresponding path program 1 times [2021-03-26 09:58:20,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:20,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890152594] [2021-03-26 09:58:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:58:20,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:20,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:20,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:58:20,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 09:58:20,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:58:20,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:58:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:58:20,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890152594] [2021-03-26 09:58:20,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:58:20,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:58:20,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441073848] [2021-03-26 09:58:20,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 09:58:20,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:58:20,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 09:58:20,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 09:58:20,657 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 181 [2021-03-26 09:58:20,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 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) [2021-03-26 09:58:20,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:58:20,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 181 [2021-03-26 09:58:20,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:58:20,734 INFO L129 PetriNetUnfolder]: 57/222 cut-off events. [2021-03-26 09:58:20,734 INFO L130 PetriNetUnfolder]: For 623/710 co-relation queries the response was YES. [2021-03-26 09:58:20,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 222 events. 57/222 cut-off events. For 623/710 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1250 event pairs, 5 based on Foata normal form. 67/281 useless extension candidates. Maximal degree in co-relation 925. Up to 137 conditions per place. [2021-03-26 09:58:20,736 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 2 selfloop transitions, 10 changer transitions 13/41 dead transitions. [2021-03-26 09:58:20,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 41 transitions, 322 flow [2021-03-26 09:58:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:58:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:58:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1089 transitions. [2021-03-26 09:58:20,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8595106550907656 [2021-03-26 09:58:20,739 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1089 transitions. [2021-03-26 09:58:20,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1089 transitions. [2021-03-26 09:58:20,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:58:20,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1089 transitions. [2021-03-26 09:58:20,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 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) [2021-03-26 09:58:20,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 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) [2021-03-26 09:58:20,744 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 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) [2021-03-26 09:58:20,744 INFO L185 Difference]: Start difference. First operand has 57 places, 40 transitions, 290 flow. Second operand 7 states and 1089 transitions. [2021-03-26 09:58:20,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 41 transitions, 322 flow [2021-03-26 09:58:20,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 41 transitions, 294 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-26 09:58:20,749 INFO L241 Difference]: Finished difference. Result has 60 places, 28 transitions, 180 flow [2021-03-26 09:58:20,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=60, PETRI_TRANSITIONS=28} [2021-03-26 09:58:20,750 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2021-03-26 09:58:20,750 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:58:20,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 28 transitions, 180 flow [2021-03-26 09:58:20,750 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 28 transitions, 180 flow [2021-03-26 09:58:20,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 28 transitions, 180 flow [2021-03-26 09:58:20,755 INFO L129 PetriNetUnfolder]: 6/38 cut-off events. [2021-03-26 09:58:20,755 INFO L130 PetriNetUnfolder]: For 55/59 co-relation queries the response was YES. [2021-03-26 09:58:20,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 38 events. 6/38 cut-off events. For 55/59 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 122. Up to 12 conditions per place. [2021-03-26 09:58:20,756 INFO L142 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-26 09:58:21,280 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 09:58:21,451 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 09:58:22,089 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 172 [2021-03-26 09:58:22,367 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-26 09:58:23,624 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 296 DAG size of output: 252 [2021-03-26 09:58:24,178 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 09:58:24,588 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 09:58:24,759 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 09:58:24,815 INFO L154 LiptonReduction]: Checked pairs total: 270 [2021-03-26 09:58:24,815 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 09:58:24,816 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4066 [2021-03-26 09:58:24,816 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 23 transitions, 166 flow [2021-03-26 09:58:24,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 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) [2021-03-26 09:58:24,817 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:58:24,817 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:58:24,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 09:58:24,817 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:58:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:58:24,817 INFO L82 PathProgramCache]: Analyzing trace with hash -423596130, now seen corresponding path program 1 times [2021-03-26 09:58:24,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:58:24,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163028439] [2021-03-26 09:58:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:58:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:58:24,866 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:58:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:58:24,929 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:58:24,969 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 09:58:24,969 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 09:58:24,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 09:58:25,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 09:58:25 BasicIcfg [2021-03-26 09:58:25,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 09:58:25,078 INFO L168 Benchmark]: Toolchain (without parser) took 15192.78 ms. Allocated memory was 255.9 MB in the beginning and 545.3 MB in the end (delta: 289.4 MB). Free memory was 233.9 MB in the beginning and 211.0 MB in the end (delta: 22.9 MB). Peak memory consumption was 311.5 MB. Max. memory is 16.0 GB. [2021-03-26 09:58:25,078 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 09:58:25,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.13 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 233.9 MB in the beginning and 313.6 MB in the end (delta: -79.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 09:58:25,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.24 ms. Allocated memory is still 354.4 MB. Free memory was 313.6 MB in the beginning and 311.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:58:25,079 INFO L168 Benchmark]: Boogie Preprocessor took 46.62 ms. Allocated memory is still 354.4 MB. Free memory was 311.6 MB in the beginning and 308.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:58:25,079 INFO L168 Benchmark]: RCFGBuilder took 1806.26 ms. Allocated memory is still 354.4 MB. Free memory was 308.8 MB in the beginning and 301.3 MB in the end (delta: 7.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.0 GB. [2021-03-26 09:58:25,080 INFO L168 Benchmark]: TraceAbstraction took 12736.86 ms. Allocated memory was 354.4 MB in the beginning and 545.3 MB in the end (delta: 190.8 MB). Free memory was 301.3 MB in the beginning and 211.0 MB in the end (delta: 90.3 MB). Peak memory consumption was 281.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:58:25,081 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.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 556.13 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 233.9 MB in the beginning and 313.6 MB in the end (delta: -79.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 42.24 ms. Allocated memory is still 354.4 MB. Free memory was 313.6 MB in the beginning and 311.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 46.62 ms. Allocated memory is still 354.4 MB. Free memory was 311.6 MB in the beginning and 308.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1806.26 ms. Allocated memory is still 354.4 MB. Free memory was 308.8 MB in the beginning and 301.3 MB in the end (delta: 7.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12736.86 ms. Allocated memory was 354.4 MB in the beginning and 545.3 MB in the end (delta: 190.8 MB). Free memory was 301.3 MB in the beginning and 211.0 MB in the end (delta: 90.3 MB). Peak memory consumption was 281.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2888.9ms, 105 PlacesBefore, 50 PlacesAfterwards, 97 TransitionsBefore, 41 TransitionsAfterwards, 1778 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3086 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1631, positive: 1552, positive conditional: 1552, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1631, positive: 1552, positive conditional: 0, positive unconditional: 1552, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1631, positive: 1552, positive conditional: 0, positive unconditional: 1552, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1261, positive: 1220, positive conditional: 0, positive unconditional: 1220, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1261, positive: 1214, positive conditional: 0, positive unconditional: 1214, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 600, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 576, negative conditional: 0, negative unconditional: 576, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1631, positive: 332, positive conditional: 0, positive unconditional: 332, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 1261, unknown conditional: 0, unknown unconditional: 1261] , Statistics on independence cache: Total cache size (in pairs): 1261, Positive cache size: 1220, Positive conditional cache size: 0, Positive unconditional cache size: 1220, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1832.3ms, 47 PlacesBefore, 34 PlacesAfterwards, 38 TransitionsBefore, 25 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 1610 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 570, positive: 469, positive conditional: 469, positive unconditional: 0, negative: 101, negative conditional: 101, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 570, positive: 469, positive conditional: 22, positive unconditional: 447, negative: 101, negative conditional: 4, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 570, positive: 469, positive conditional: 22, positive unconditional: 447, negative: 101, negative conditional: 4, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 165, positive: 140, positive conditional: 6, positive unconditional: 134, negative: 25, negative conditional: 2, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 165, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 25, negative conditional: 2, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 416, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 385, negative conditional: 46, negative unconditional: 338, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 570, positive: 329, positive conditional: 16, positive unconditional: 313, negative: 76, negative conditional: 2, negative unconditional: 74, unknown: 165, unknown conditional: 8, unknown unconditional: 157] , Statistics on independence cache: Total cache size (in pairs): 1426, Positive cache size: 1360, Positive conditional cache size: 6, Positive unconditional cache size: 1354, Negative cache size: 66, Negative conditional cache size: 2, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1327.9ms, 40 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 717 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 228, positive: 186, positive conditional: 186, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 228, positive: 186, positive conditional: 0, positive unconditional: 186, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 228, positive: 186, positive conditional: 0, positive unconditional: 186, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1434, Positive cache size: 1367, Positive conditional cache size: 6, Positive unconditional cache size: 1361, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.3ms, 37 PlacesBefore, 37 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 312 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, positive: 75, positive conditional: 75, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1434, Positive cache size: 1367, Positive conditional cache size: 6, Positive unconditional cache size: 1361, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.7ms, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 363 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1434, Positive cache size: 1367, Positive conditional cache size: 6, Positive unconditional cache size: 1361, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.9ms, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 804 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, positive: 92, positive conditional: 42, positive unconditional: 50, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 92, positive conditional: 42, positive unconditional: 50, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 9, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 78, positive conditional: 33, positive unconditional: 45, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 14, unknown conditional: 9, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1448, Positive cache size: 1381, Positive conditional cache size: 15, Positive unconditional cache size: 1366, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.8ms, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, positive: 12, positive conditional: 2, positive unconditional: 10, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 12, positive conditional: 2, positive unconditional: 10, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, positive: 12, positive conditional: 2, positive unconditional: 10, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1448, Positive cache size: 1381, Positive conditional cache size: 15, Positive unconditional cache size: 1366, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 116.3ms, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 471 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, positive: 24, positive conditional: 4, positive unconditional: 20, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 4, positive unconditional: 20, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 24, positive conditional: 4, positive unconditional: 20, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1448, Positive cache size: 1381, Positive conditional cache size: 15, Positive unconditional cache size: 1366, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.8ms, 57 PlacesBefore, 57 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 632 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, positive: 151, positive conditional: 83, positive unconditional: 68, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, positive: 151, positive conditional: 83, positive unconditional: 68, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, positive: 133, positive conditional: 76, positive unconditional: 57, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 20, unknown conditional: 7, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1468, Positive cache size: 1399, Positive conditional cache size: 22, Positive unconditional cache size: 1377, Negative cache size: 69, Negative conditional cache size: 2, Negative unconditional cache size: 67, Eliminated conditions: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4065.4ms, 60 PlacesBefore, 51 PlacesAfterwards, 28 TransitionsBefore, 23 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 92, positive conditional: 63, positive unconditional: 29, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 92, positive conditional: 63, positive unconditional: 29, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 119, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 76, positive conditional: 55, positive unconditional: 21, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 22, unknown conditional: 8, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 1490, Positive cache size: 1415, Positive conditional cache size: 30, Positive unconditional cache size: 1385, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 8 - 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=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] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] EXPR 3 !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) [L804] 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) [L805] EXPR 3 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)) [L805] 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)) [L806] EXPR 3 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)) [L806] 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)) [L807] EXPR 3 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)) [L807] 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)) [L808] EXPR 3 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)) [L808] 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)) [L809] EXPR 3 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)) [L809] 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)) [L810] EXPR 3 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)) [L810] 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)) [L811] 3 __unbuffered_p2_EBX = z [L812] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=255, 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] [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 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) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 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 [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 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 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 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) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 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 [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 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 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 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) [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 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 [L819] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L820] 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 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12483.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 810.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2964.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 54 SDtfs, 28 SDslu, 29 SDs, 0 SdLazy, 132 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 148.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 110.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 26.6ms SsaConstructionTime, 286.4ms SatisfiabilityAnalysisTime, 506.4ms InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...